Highly Influenced

# Solving Geometric Covering Problems by Data Reduction

@inproceedings{Mecke2004SolvingGC, title={Solving Geometric Covering Problems by Data Reduction}, author={Steffen Mecke and Dorothea Wagner}, booktitle={ESA}, year={2004} }

- Published 2004 in ESA
DOI:10.1007/978-3-540-30140-0_67

We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core problem is a geometric set covering problem which is NP-hard in general. However, if the corresponding covering matrix has the consecutive ones property, it is solvable in polynomial time. In this paper, we present data reduction techniques for set covering and report on an experimental study considering real world data… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

26 Extracted Citations

11 Extracted References

Similar Papers