scientific article
From MaRDI portal
Publication:3840354
zbMath0910.90263MaRDI QIDQ3840354
Stavros G. Kolliopoulos, Clifford Stein
Publication date: 19 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time approximationpacking integer programsedge and vertex-disjoint path problemsunsplittable flow generalization
Related Items (14)
A note on multiflows and treewidth ⋮ Finding disjoint paths with related path costs ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Approximating covering integer programs with multiplicity constraints ⋮ Finding multiple induced disjoint paths in general graphs ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints ⋮ Shortest node-disjoint paths on random graphs ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ Disjoint paths in sparse graphs ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems ⋮ A note on the greedy algorithm for the unsplittable flow problem ⋮ Approximating low-congestion routing and column-restricted packing problems
This page was built for publication:
