Short length Menger's theorem and reliable optical routing

DOI10.1016/J.TCS.2005.03.009zbMATH Open1161.68642OpenAlexW2093227716MaRDI QIDQ557907FDOQ557907

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

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

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)

Cites Work

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

Cited In (4)

• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• Short length Menger's theorem and reliable optical routing
• Title not available (Why is that?)
• 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)