Amanote Research
Register
Sign In
Fast Approximation Algorithms for Multicommodity Flow Problems
doi 10.1145/103418.103425
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1991
Authors
Tom Leighton
Clifford Stein
Fillia Makedon
Éva Tardos
Serge Plotkin
Spyros Tragoudas
Publisher
ACM Press
Related search
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for Partial Covering Problems*1
Journal of Algorithms
Approximation Algorithms for Multi-Dimensional Vector Assignment Problems
SSRN Electronic Journal
Local Convex Hulls for a Special Class of Integer Multicommodity Flow Problems
Computational Optimization and Applications
Control
Computational Mathematics
Applied Mathematics
Optimization
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
Multicommodity Flow and Circuit Switching
