Strongly Polynomial Algorithms for the Unsplittable Flow Problem

  title={Strongly Polynomial Algorithms for the Unsplittable Flow Problem},
  author={Yossi Azar and Oded Regev},
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 74 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 44 extracted citations

A Traffic Engineering Approach for Placement and Selection of Network Services

IEEE/ACM Transactions on Networking • 2007
View 4 Excerpts
Highly Influenced

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Efficient Approximation and Online Algorithms • 2006
View 6 Excerpts
Highly Influenced

The k-Splittable Flow Problem

View 4 Excerpts
Highly Influenced

Edge-disjoint paths revisited

ACM Trans. Algorithms • 2003
View 4 Excerpts
Highly Influenced

Maximizing Restorable Throughput in MPLS Networks

INFOCOM 2008 • 2008
View 17 Excerpts
Highly Influenced

74 Citations

Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-3 of 3 references

Strongly polynomial algorithms for the unsplittable flow problem

Yossi Azar, Oded Regev
Lecture Notes in Computer Science, • 2001
View 1 Excerpt

The dire ted homeomorphism problem

J. Wyllie
Theoreti alComputer S ien e • 1998

Similar Papers

Loading similar papers…