On the complexity of vertex-disjoint length-restricted path problems

Computational Complexity

Volumn 12, Issue 3-4, 2003, Pages 131-149

  Bley, Andreas ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Approximability; Disjoint paths; Length restricted paths

Indexed keywords

EID: 4744349395     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-003-0179-6     Document Type: Article

References (16)

1. D. ALEVRAS, M. GRÖTSCHEL & R. WESSÄLY (1997). Capacity and survivability models for telecommunications networks. In Plenaries and Tutorials of the 15th EURO 34th INFORMS Symposium, J. Barceló (ed.), Departement d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Barcelona.
2. G. AUSIELLO, P. CRESCENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA & M. PROTASI (1999). Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer.
3. D. BOVET & P. CRESCENZI (1994). Introduction to the Theory of Complexity. Prentice-Hall International.
4. P. CRESCENZI & V. KANN (1995). A compendium of NP optimization problems. Technical report, Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza". Latest version available online at http://www.nada.kth.se/~viggo/problemlist/.
5. P. CRESCENZI, V. KANN, R. SILVESTRI & L. TREVISAN (1999). Structure in approximation classes. SIAM J. Comput. 28, 1759-1782.
6. J. EDMUNDS (1965). Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125-130.
7. H. N. GABOW (1988). Data structures for weighted matching and nearest common ancestors with linking. In Proc. 1st ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), 434-443.
8. V. GURUSWAMI, S. KHANNA, R. RAJARAMAN, B. SHEPHERD & M. YANNAKAKIS (1999). Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proc. 31st Annual ACM Symposium on Theory of Computing (Atlanta, GA), 19-28.
9. A. ITAI, Y. PERL & Y. SHILOACH (1982). The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277-286.
10. L. LOVÁSZ, V. NEUMANN-LARA & M. PLUMMER (1978). Mengerian Theorems for paths of bounded length. Period. Math. Hungar. 9, 269-276.
11. P. ORPONEN & H. MANNILA (1987). On approximation preserving reductions: complete problems and robust measures. Technical Report C-1987-28, Dept. of Computer Sci., Univ. of Helsinki.
12. C. H. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
13. C. H. PAPADIMITRIOU & M. YANNAKAKIS (1988). Optimization, approximation, and complexity classes. In Proc. 20th Annual ACM Symposium on Theory of Computing (Chicago, IL), 229-234.
14. C. H. PAPADIMITRIOU & M. YANNAKAKIS (1991). Optimization, approximation, and complexity classes. J. Comput. System Sci. 43, 445-440.
15. Y. PERL & D. RONEN (1984). Heuristics for finding a maximum number of disjoint bounded paths. Networks 14, 531-544.
16. J. W. SUURBALLE (1974). Disjoint paths in a network. Networks 4, 125-145.