MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the disjoint paths problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

218 documents found, showing 1 through 10. Next 10 →

ATOM

Approximation Algorithms for Disjoint Paths Problems
by Jon Michael Kleinberg — 1996
…Approximation Algorithms for Disjoint Paths Problems by Jon Michael Kleinberg S.M., Electrical…
Cited by 101 (0 self) – Add To MetaCart

Preselecting Homotopies for the Weighted Disjoint Paths Problem
by A. M. H. Gerards, F. B. Shepherd — 1993
… Preselecting Homotopies for the Weighted Disjoint Paths Problem 1 A.M.H. Gerards C.W.I. P.O. Box…
Cited by 1 (0 self) – Add To MetaCart

Eulerian disjoint paths problem in grid graphs is NP-complete
by Dániel Marx — 2004 — Discrete Applied Mathematics
…Eulerian disjoint paths problem in grid graphs is NP-complete ∗ Dániel Marx † 12th December 2003…
Cited by 4 (1 self) – Add To MetaCart

On the Irrelevance of Edge Orientations on the Acyclic Directed Two Disjoint Paths Problem
by C.L. Lucchesi, Cl'audio L. Lucchesi, Maria Cec'ilia M. T. Giglio — 1992
… on the Acyclic Directed Two Disjoint Paths Problem Cl'audio L. Lucchesi Maria Cec'ilia M. T. Giglio Relat…
Cited by 1 (0 self) – Add To MetaCart

The Maximum Edge-Disjoint Paths Problem In Bidirected Trees
by Thomas Erlebach, Klaus Jansen — 1998 — SIAM Journal on Discrete Mathematics
…THE MAXIMUM EDGE-DISJOINT PATHS PROBLEM IN BIDIRECTED TREES THOMAS ERLEBACH y AND KLAUS JANSEN…
Cited by 14 (2 self) – Add To MetaCart

Approximating Disjoint-Path Problems Using Packing Integer Programs
by Stavros G. Kolliopoulos, Clifford Stein — 1998
…Approximating Disjoint-Path Problems Using Packing Integer Programs Stavros G. Kolliopoulos 1…
Cited by 6 (1 self) – Add To MetaCart

Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem
by Jon M. Kleinberg — 1998 — Proc. 30th ACM Symp. on Theory of Computing
…Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem Jon M. Kleinberg…
Cited by 5 (1 self) – Add To MetaCart

Hardness of the undirected edge-disjoint paths problem with congestion
by Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang — 2005 — In Proceedings of the 37th Annual ACM Symposium on Theory of Computing
… Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion Matthew Andrews* Julia…
Cited by 26 (4 self) – Add To MetaCart

Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems
by Prasad Jayanti, Fillia Makedon, Aravind Srinivasan, Neal E. Young, Roger D. Sloboda, Stavros G. Kolliopoulos, Stavros G. Kolliopoulos — 1998
…EXACT AND APPROXIMATION ALGORITHMS FOR NETWORK FLOW AND DISJOINT-PATH PROBLEMS A Thesis Submitted…
Add To MetaCart

Simple On-line Algorithms for the Maximum Disjoint Paths Problem
by Petr Kolman, Christian Scheideler — 2001 — Algorithmica
…Simple On-line Algorithms for the Maximum Disjoint Paths Problem Petr Kolman Dept. of Applied…
Cited by 12 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB