Venkatesan Guruswami
Sanjeev Khanna
- 1.A. BAVEJA AND A. $RINIVASAN. Approximation algorithms for disjoint paths and related routing and packing problems. Submitted, January 1998. Google Scholar
Digital Library
- 2.A. BLEY. On the complexity of vertex-disjoint lengthrestricted path problems. Konrad. Zuse-Zentrum fiir In- ~ormationstechnik Berlin Tech. Report $C-98-~0, 1998.Google Scholar
- 3.~I. CHERNOFF. A measure of asymptotic e~ciency for tests of a hypothesis based on the sum of observations. Annals o)~ Mathematical Statistics, 23:493-507, 1952.Google Scholar
- 4.E. A. DINITZ. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl., Vol. 11 (1970), pp. 1277-1280.Google Scholar
- 5.Y. D~N~Tz, N. G^RG AND M. GOrM~NS. On ~he single source unsplittable flow problem, Proc. ojr FOC$ '98, pp. 290-299. Google ScholarDigital Library
- 6.S. EVEN, A. ITA~ AND A. SHAMIR. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, Vol. 5, No. 4 (I976), pp. 691- 703.Google ScholarCross Ref
- 7.S. FORTUSE, J. HorcRorT ~D J. WYLbm. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111-121.Google ScholarCross Ref
- 8.N. (~ARG, V. VAZIRANI AND M. YANNAKAKIS. Primaldual approximation algorithms for integral flow and multicut in trees. Algorighmica, 18 (1997), pp. 3-20.Google ScholarDigital Library
- 9.W. HOEFFDING. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.Google ScholarCross Ref
- 10.J. H~STAD. Clique is hard to approximate within ~-'. ECCC Technical Report TR97-038. (PreIiminary version in Proc. of FOCS '96, pp. 527-536).Google Scholar
- 11.T. C. Hu. Multi-commodity Network Flows. Operations Research, 11(1963), pp. 344-360.Google Scholar
- 12.V. KANN. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37(1991), pp. 27-35. Google ScholarDigital Library
- 13.R. M. K~.r.l~. Reducibility among combinatdriat problems. Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., New York: Plenum Press, 1972, pp. 85-103.Google Scholar
- 14.J. M. KLE~r/BERG. Single-source unsplittable flow. Proc. of FOCS '96, pp. 68-77. Google ScholarDigital Library
- 15.J. M. KLEINBERG. Appro~mation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996. Google ScholarDigital Library
- 16.J. M. KLEINBEgG. Decision algorithms for unsplittable flow and the half-disjoint paths problem. Proc. of STOC '98, pp. 530-539. Google ScholarDigital Library
- 17.S. G. Ko~r~orouLos. Exact and approximation algorithms for network flow and disjoint-path problems. PhD Thesis, Dartmouth ColIege, Hanover, NH, August 1998.Google Scholar
- 18.S. G. Kor~.~orovLos ^rq~) C. STEI~. Improved approximation algorithms for unsplittable flow problems. Proc. o.f FOCS '9'7, pp. 426-435. Google ScholarDigital Library
- 19.S. G. KOLL~OrOVLOS ^ND C. STrIN. Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs. IPCO 98.Google Scholar
- 20.F. T. LS~C.I~TOl~ ^~) S. B. R~.o. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proc. oj~ FOCS '88, pp. 422-431. Google ScholarDigital Library
- 21.B. M^ ~ND L. W^NG. On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints. Journal of Computer and Systems Sciences, to appear. Google ScholarDigital Library
- 22.W. S. M~.ssrY. Algebraic Topology: An Introduction. Graduate texts in mathematics 56, Springer-Verlag, 1967.Google Scholar
- 23.P. R^an~w~ ~ C. D. TnoM?sor~. Randomized rounding: A technique for provably good algorithms and ~gorithmic proofs. Combinatorica, Vol. 7 (1987), pp. 365-374. Google ScholarDigital Library
- 24.N. ROBERT$ON AND P. D. SEYMOUR. Outline of a disjoint paths algorithm. In B. Korte, L. Lovksz, H. J. PrSmel, and A. Schrijver, Eds., Paths, Flows and VLSI-Layout. Springer-Verlag, Berlin, 1990.Google Scholar
- 25.A. Sg~N~VASAN. Improved approximations for edgedisjoint paths, unsplittable flow, and related routing problems. Proc. of FOCS'97, pp. 416-425. Google ScholarDigital Library
Index Terms
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Recommendations
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs (si, ti), 1 ≤i≤k, and the goal is to find a largest subset of source-sink pairs that can ...
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
In the maximum edge-disjoint paths problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum number of pairs that can be routed by edge-disjoint paths. An r-approximation algorithm for this problem is ...
Comments