The maximum edge-disjoint paths problem in complete graphs
Author:
- Adrian KosowskiAKAdrian Kosowski
- 1 June 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 399 (1-2) , 128-140
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Hardness of the undirected edge-disjoint paths problem2005
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problemsJournal of Computer and System Sciences, 2003
- On-Line Edge-Coloring with a Fixed Number of ColorsAlgorithmica, 2003
- Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems2002
- Efficient routing in all-optical networks1994
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems1983
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949