Station Location - Complexity and Approximation

  title={Station Location - Complexity and Approximation},
  author={Steffen Mecke and Anita Sch{\"o}bel and Dorothea Wagner},
We consider a geometric set covering problem. In its original form it consists of adding stations to an existing geometric transportation network so that each of a given set of settlements is not too far from a station. The problem is known to be NP-hard in general. However, special cases with certain properties have been shown to be efficiently solvable in theory and in practice, especially if the covering matrix has (almost) consecutive ones property. In this paper we are narrowing the gap… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-10 of 20 references

Set covering problems with consecutive ones property

  • A. Schöbel
  • Technical report, University of Kaiserslautern
  • 2005
2 Excerpts

A geometric theorem for approximate disk covering algorithms

  • M. Franceschetti, M. Cook, J. Bruck
  • Technical report, California Institute of…
  • 2001
1 Excerpt

Graph Drawing

  • G. di Battista, P. Eades, R. Tamassia, I. G. Tollis
  • Prentice Hall, Inc.
  • 1999

Similar Papers

Loading similar papers…