Station location -- complexity and approximation

DOI10.4230/OASICS.ATMOS.2005.661MaRDI QIDQ2917411zbMATH OpenOpenAlexFDO

Authors Steffen Mecke, Anita Schöbel, Dorothea Wagner

Publication date 28 September 2012

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2006/661/pdf/06001.MeckeSteffen.Paper.661.pdf

zbMATH Keywords

complexityapproximationfacility locationstation location

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Recommendations

• Algorithms – ESA 2004
• scientific article; zbMATH DE number 2011862
• Set covering with almost consecutive ones property
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• The station location problem on two intersecting lines

Cited in

(15)

• scientific article; zbMATH DE number 1629974 (Why is no real title available?)
• The parameterized complexity of stabbing rectangles
• A faster algorithm for finding minimum Tucker submatrices
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• The station location problem on two intersecting lines
• Station assignment with applications to sensing
• Red-blue covering problems and the consecutive ones property
• Set covering with almost consecutive ones property
• The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• scientific article; zbMATH DE number 1688370 (Why is no real title available?)
• scientific article; zbMATH DE number 6179281 (Why is no real title available?)
• scientific article; zbMATH DE number 2011862 (Why is no real title available?)
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• Algorithms – ESA 2004

This page was built for publication: Station location -- complexity and approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917411)