Improved approximation algorithms for unsplittable flow problems

@article{Kolliopoulos1997ImprovedAA,
  title={Improved approximation algorithms for unsplittable flow problems},
  author={Stavros G. Kolliopoulos and Clifford Stein},
  journal={Proceedings 38th Annual Symposium on Foundations of Computer Science},
  year={1997},
  pages={426-436}
}
In the single-source unsplittable flow problem we are given a graph G, a source vertex s and a set of sinks t/sub 1/, ..., t/sub k/ with associated demands. We seek a single s-t/sub i/ flow path for each commodity i so that the demands are satisfied and the total flow routed across any edge e is bounded by its capacity c/sub e/. The problem is an NP-hard variant of max flow and a generalization of single-source edge-disjoint paths with applications to scheduling, load balancing and virtual… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 91 CITATIONS, ESTIMATED 84% COVERAGE

On the Single-Source Unsplittable Flow Problem

VIEW 13 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On the single-source unsplittable flow problem

  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
VIEW 11 EXCERPTS
HIGHLY INFLUENCED

Heuristic algorithms for wireless mesh network planning

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Resilient Virtual Network Service Provision in Network Virtualization Environments

  • 2010 IEEE 16th International Conference on Parallel and Distributed Systems
  • 2010
VIEW 4 EXCERPTS
HIGHLY INFLUENCED

Approximability of unsplittable shortest path routing problems

  • Networks
  • 2009
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

  • Math. Oper. Res.
  • 2000
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Integer Programming and Combinatorial Optimization

  • Lecture Notes in Computer Science
  • 1998
VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1997
2019

CITATION STATISTICS

  • 18 Highly Influenced Citations

  • Averaged 4 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Beyond flow decomposition barrier

A. V. Golderg, S. Rao
  • 1997

An extension of the Lov6sz Local Lemma and its applications to integer programming

A. Srinivasan
  • In Proceedings of the '7th ACM-SIAM Symposium on Discrete Algorithms,
  • 1996

Single-source unsplittable flow

  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996

Disjoint paths in densely embedded graphs

  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995

Similar Papers

Loading similar papers…