Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs

DOI10.1007/11780823_11MaRDI QIDQ3613649zbMATH OpenOpenAlexFDO

Authors Adrian Kosowski

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• The maximum edge-disjoint paths problem in complete graphs
• Graph-Theoretic Concepts in Computer Science
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
• Edge-disjoint paths revisited
• scientific article; zbMATH DE number 2079393

Cited in

(1)

• The maximum edge-disjoint paths problem in complete graphs

This page was built for publication: Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs

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