Publication | Closed Access

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

Mathematical ProgrammingRelated ProblemsEngineeringGraph TheoryExtremal Graph TheoryCombinatorial ProblemDiscrete OptimizationBusinessComputational ComplexityExtremal CombinatoricsGraph AlgorithmComputer ScienceApproximation AlgorithmsDiscrete MathematicsCombinatorial OptimizationComputational GeometryApproximation TheoryNear-optimal Hardness Results