Short length Menger's theorem and reliable optical routing

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 246-247

  Bagchi, Amitabha ^a   Chaudhary, Amitabh ^a   Kolman, Petr ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Fault tolerant routing; Flow Number; Menger's theorem; Path coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION;

FLOW NUMBERS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0038041038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777449.777453     Document Type: Conference Paper

References (5)

1. A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler. Algorithms for fault-tolerant routing in circuit switched networks. In SPAA '02, pages 265-274, 2002.
2. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In STOC '99, pages 19-28, 1999.
3. P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. In SODA '02, pages 184-193, 2002.
4. Y. Rabani. Path coloring on the mesh. In FOCS '96, pages 400-409, 1996.
5. C. Scheideler. Probabilistic Methods for Coordination Problems. Habilitation thesis, University of Paderborn, July 2000.