Short length Menger's theorem and reliable optical routing

DOI10.1016/j.tcs.2005.03.009zbMath1161.68642OpenAlexW2093227716MaRDI QIDQ557907

Amitabh Chaudhary, Petr Kolman, Amitabha Bagchi

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.009

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

Maximum \(k\)-splittable \(s, t\)-flows ⋮ Short length Menger's theorem and reliable optical routing ⋮ Unnamed Item

Cites Work

• Short length Menger's theorem and reliable optical routing
• The edge intersection graphs of paths in a tree
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• On the complexity of vertex-disjoint length-restricted path problems
• On-line routing in all-optical networks
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
• On multiroute maximum flows in networks
• Efficient routing in all-optical networks
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• Distributed Computing
• The complexity of path coloring and call scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item