Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

@article{Guruswami2003NearoptimalHR,
  title={Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems},
  author={Venkatesan Guruswami and Sanjeev Khanna and Rajmohan Rajaraman and F. Bruce Shepherd and Mihalis Yannakakis},
  journal={J. Comput. Syst. Sci.},
  year={2003},
  volume={67},
  pages={473-496}
}
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 157 CITATIONS, ESTIMATED 29% COVERAGE

The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems

  • Theory of Computing
  • 2017
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Survivability in Time-Varying Networks

  • IEEE Transactions on Mobile Computing
  • 2017
VIEW 17 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

path-constrained network flows

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Length-Bounded Cuts and Flows

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Combinatorial Algorithms for the Unsplittable Flow Problem

  • Algorithmica
  • 2005
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Minimal multicut and maximal integer multiflow: A survey

  • European Journal of Operational Research
  • 2005
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2000
2018

CITATION STATISTICS

  • 22 Highly Influenced Citations

  • Averaged 7 Citations per year over the last 3 years

Similar Papers

Loading similar papers…