On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Edge disjoint paths revisited

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Journal of Computer and System Sciences

Hardness of the undirected edge-disjoint paths problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Logarithmic hardness of the undirected edge-disjoint paths problem

Journal of the ACM (JACM)

Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities

IEEE/ACM Transactions on Networking (TON)

Edge-disjoint paths revisited

ACM Transactions on Algorithms (TALG)

Approximation algorithms and hardness results for cycle packing problems

ACM Transactions on Algorithms (TALG)

On routing in VLSI design and communication networks

Discrete Applied Mathematics

Approximation strategies for routing edge disjoint paths in complete graphs

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Disjoint cycles: integrality gap, hardness, and approximation

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Approximation algorithms for edge-disjoint paths and unsplittable flow

Efficient Approximation and Online Algorithms

On the disjoint paths problem

Operations Research Letters