# 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} }

- Published in Proceedings 38th Annual Symposium on Foundations…1997
DOI:10.1109/SFCS.1997.646131

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

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

VIEW 4 EXCERPTS

HIGHLY INFLUENCED

## Approximability of unsplittable shortest path routing problems

VIEW 10 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

VIEW 7 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow

VIEW 9 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Exact and approximation algorithms for network flow and disjoint-path problems

VIEW 11 EXCERPTS

CITES BACKGROUND, RESULTS & METHODS

HIGHLY INFLUENCED

## Integer Programming and Combinatorial Optimization

VIEW 11 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Efficient virtual network embedding algorithm based on restrictive selection and optimization theory approach

VIEW 5 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

### FILTER CITATIONS BY YEAR

### 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

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

#### Similar Papers

Loading similar papers…