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

Time-constrained scheduling of weighted packets on trees and meshes

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures

Connectivity and inference problems for temporal networks

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Simple on-line algorithms for the maximum disjoint paths problem

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

Improved bounds for the unsplittable flow problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Algorithms for fault-tolerant routing in circuit switched networks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures

Edge disjoint paths revisited

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

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

Call Control with k Rejections

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

Approximation Algorithms for the Unsplittable Flow Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization

New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

Short length menger's theorem and reliable optical routing

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Connectivity and inference problems for temporal networks

Journal of Computer and System Sciences - Special issue on STOC 2000

Routing using potentials: a dynamic traffic-aware routing algorithm

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees

Journal of Experimental Algorithmics (JEA)

A note on the greedy algorithm for the unsplittable flow problem

Information Processing Letters

Call control with k rejections

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity

Graph decomposition and a greedy algorithm for edge-disjoint paths

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

New hardness results for congestion minimization and machine scheduling

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

The all-or-nothing multicommodity flow problem

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

On the complexity of vertex-disjoint length-restricted path problems

Computational Complexity

Hardness of the undirected edge-disjoint paths problem

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

Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Logarithmic hardness of the directed congestion minimization problem

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

A quasi-PTAS for unsplittable flow on line graphs

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

Path problems in generalized stars, complete graphs, and brick wall graphs

Discrete Applied Mathematics - Special issue: Efficient algorithms

The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)

Short length Menger's theorem and reliable optical routing

Theoretical Computer Science

Improved bounds for the unsplittable flow problem

Journal of Algorithms

Truthful unsplittable flow for large capacity networks

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures

DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks

Journal of Experimental Algorithmics (JEA)

Flows with Unit Path Capacities and Related Packing and Covering Problems

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications

Paths and trails in edge-colored graphs

Theoretical Computer Science

A logarithmic approximation for unsplittable flow on line graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics

Path problems in generalized stars, complete graphs, and brick wall graphs

Discrete Applied Mathematics - Special issue: Efficient algorithms

Multicommodity demand flow in a tree

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Convex combinations of single source unsplittable flows

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Paths and trails in edge-colored graphs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Odd cycle packing

Proceedings of the forty-second ACM symposium on Theory of computing

Replication routing in DTNs: a resource allocation approach

IEEE/ACM Transactions on Networking (TON)

K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Pairwise intersession network coding on directed networks

IEEE Transactions on Information Theory

An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Edge Disjoint Paths in Moderately Connected Graphs

SIAM Journal on Computing

The disjoint paths problem: algorithm and structure

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two

Proceedings of the forty-third annual ACM symposium on Theory of computing

Generating randomized roundings with cardinality constraints and derandomizations

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Edge disjoint paths in moderately connected graphs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Length-bounded cuts and flows

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Greedy approximation via duality for packing, combinatorial auctions and routing

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Roundings respecting hard constraints

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Off-line admission control for advance reservations in star networks

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms

Approximation algorithms for edge-disjoint paths and unsplittable flow

Efficient Approximation and Online Algorithms

The maximum integer multiterminal flow problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Approximability of 3- and 4-hop bounded disjoint paths problems

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Approximation algorithms for throughput maximization in wireless networks with delay constraints

IEEE/ACM Transactions on Networking (TON)