Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs

DOI10.1007/11780823_11zbMath1222.68414MaRDI QIDQ3613649

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

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

68W27: Online algorithms; streaming algorithms