Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
Open Access
- 31 August 1998
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 57 (1) , 61-73
- https://doi.org/10.1006/jcss.1998.1579
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Throughput-competitive on-line routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On-line admission control and circuit routing for high performance computing and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal Construction of Edge-Disjoint Paths in Random GraphsSIAM Journal on Computing, 1998
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- On the complexity of the disjoint paths problemCombinatorica, 1993
- Edge-disjoint paths in planar graphsJournal of Combinatorial Theory, Series B, 1985
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- Disjoint Common Transversals and Exchange StructuresJournal of the London Mathematical Society, 1976
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965