Solving Geometric Covering Problems by Data Reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 760-771

  Mecke, Steffen ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RAILROAD TRANSPORTATION; TRANSPORTATION ROUTES;

CONSECUTIVE ONES PROPERTY; GEOMETRIC COVERINGS; POLYNOMIAL-TIME; PUBLIC TRANSPORTATION NETWORKS; RAILWAY SYSTEM; REDUCTION TECHNIQUES; SET COVERING PROBLEM; SET COVERINGS;

DATA REDUCTION;

EID: 33646849980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_67     Document Type: Article

References (12)

1. Harnacher, H.W., Liebers, A., Schöbel, A., Wagner, D., Wagner, F.: Locating new stops in a railway network. Electronic Notes in Theoretical Computer Science, Proc. ATMOS 2001 50 (2001)
2. Schöbel, A., Harnacher, H.W., Liebers, A., Wagner, D.: The continuous stop location problem in public transportation networks. Report in Wirtschaftsmathematik 81 (2002)
3. Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Annals of Operations Research 98 (2000) 353-371
4. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41 (1994) 960-981
5. Kranakis, E., Penna, P., Schlude, K., Taylor, D.S., Widmayer, P.: Improving customer proximity to railway stations. In Petreschi, R., Persiano, G., Silvestri, R., eds.: Proceedings of 5th Italian Conference on Algorithms and Complexity (CIAC 2003). Volume 2653 of Lecture Notes in Computer Science., Springer (2003) 264-276
6. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley (1988)
7. Weihe, K.: Covering trains by stations or the power of data reduction. In Battiti, R., Bertossi, A.A., eds.: Proceedings of Algorithms and Experiments (ALEX 98). (1998) 1-8
8. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Science 13 (1976) 335-379
9. Yellin, D.M., Jutla, C.S.: Finding extremal sets in less than quadratic time. Inform. Process. Lett. 48 (1993) 29-34
10. Pritchard, P.: An old sub-quadratic algorithm for finding extremal sets. Information Processing Letters 62 (1997) 329-334
11. Schöbel, A.: Customer-Oriented Optimization in Public Transportation. PhD thesis, University of Kaiserslautern (2002) Habilitation.
12. Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. ACM National Conference, Association of Computing Machinery (1969)