Short length Menger's theorem and reliable optical routing

DOI10.1016/J.TCS.2005.03.009MaRDI QIDQ557907zbMATH OpenOpenAlexFDO

Authors Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman

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

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

Recommendations

• scientific article; zbMATH DE number 1263226
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• On the disjoint paths problem
• scientific article; zbMATH DE number 1263178

Cites work

• scientific article; zbMATH DE number 1003273 (Why is no real title available?)
• scientific article; zbMATH DE number 1256772 (Why is no real title available?)
• scientific article; zbMATH DE number 1261807 (Why is no real title available?)
• scientific article; zbMATH DE number 1263178 (Why is no real title available?)
• scientific article; zbMATH DE number 1263226 (Why is no real title available?)
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• scientific article; zbMATH DE number 1775390 (Why is no real title available?)
• scientific article; zbMATH DE number 1775440 (Why is no real title available?)
• scientific article; zbMATH DE number 2119660 (Why is no real title available?)
• scientific article; zbMATH DE number 910915 (Why is no real title available?)
• scientific article; zbMATH DE number 961880 (Why is no real title available?)
• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• Approximating fractional multicommodity flow independent of the number of commodities
• Constructing disjoint paths for secure communication
• Efficient routing in all-optical networks
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• On multiroute maximum flows in networks.
• On the complexity of vertex-disjoint length-restricted path problems
• On-line routing in all-optical networks
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Short length Menger's theorem and reliable optical routing
• The complexity of path coloring and call scheduling
• The edge intersection graphs of paths in a tree

Cited in

(5)

• Approximation algorithms and hardness of the \(k\)-route cut problem
• scientific article; zbMATH DE number 961960 (Why is no real title available?)
• Short length Menger's theorem and reliable optical routing
• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• Maximum \(k\)-splittable \(s, t\)-flows

This page was built for publication: Short length Menger's theorem and reliable optical routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557907)