Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs

This publication has 23 references indexed in Scilit:

• Single-source unsplittable flow
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Short paths in expander graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Improved approximation algorithms for unsplittable flow problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Primal-dual approximation algorithms for integral flow and multicut in trees
  Algorithmica, 1997
• Algorithms for Square Roots of Graphs
  SIAM Journal on Discrete Mathematics, 1995
• The threshold for hamilton cycles in the square of a random graph
  Random Structures & Algorithms, 1994
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Global wire routing in two-dimensional arrays
  Algorithmica, 1987
• On the Computational Complexity of Combinatorial Problems
  Networks, 1975
• The square of every two-connected graph is Hamiltonian
  Journal of Combinatorial Theory, Series B, 1974