Station Location - Complexity and Approximation.
From MaRDI portal
Publication:2917411
DOI10.4230/OASIcs.ATMOS.2005.661zbMath1247.90176OpenAlexW1490411840MaRDI QIDQ2917411
Steffen Mecke, Dorothea Wagner, Anita Schöbel
Publication date: 28 September 2012
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/661/pdf/06001.MeckeSteffen.Paper.661.pdf
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants ⋮ The parameterized complexity of stabbing rectangles ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ A faster algorithm for finding minimum Tucker submatrices ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Parameterized Complexity of Stabbing Rectangles and Squares in the Plane ⋮ Red-blue covering problems and the consecutive ones property
This page was built for publication: Station Location - Complexity and Approximation.
