Highly Influenced

# A quasi-PTAS for unsplittable flow on line graphs

@inproceedings{Bansal2006AQF, title={A quasi-PTAS for unsplittable flow on line graphs}, author={Nikhil Bansal and Amit Chakrabarti and Amir Epstein and Baruch Schieber}, booktitle={STOC}, year={2006} }

- Published 2006 in STOC
DOI:10.1145/1132516.1132617

We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial time approximation scheme for UFP on line graphs, thereby ruling out an APX-hardness result, unless NP ⊆ DTIME(2polylog(n)). Our result requires a quasi-polynomial bound on all edge capacities and demands in the input instance. We extend this result to undirected cycle graphs.Earlier results on this… CONTINUE READING

Highly Cited

This paper has 89 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

54 Citations

9 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 90 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**90**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-9 of 9 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential