Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphs
Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A fast algorithm for maximum integral two-commodity flow in planar graphs
Discrete Applied Mathematics
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
The planar multiterminal cut problem
Discrete Applied Mathematics
Approximations for the disjoint paths problem in high-diameter planar networks
Journal of Computer and System Sciences
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Mathematics of Operations Research
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The edge-disjoint path problem is NP-complete for series-parallel graphs
Discrete Applied Mathematics - Special issue on selected papers from First Japanese-Hungarian Symposium for Discrete Mathematics and its Applications
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Edge-Disjoint Paths in Expander Graphs
SIAM Journal on Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
A note on the greedy algorithm for the unsplittable flow problem
Information Processing Letters
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Edge-Disjoint Paths in Planar Graphs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Eulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
A Note on Multiflows and Treewidth
Algorithmica
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.04 |
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg, Vazirani and Yannakakis [N. Garg, V.V. Vazirani, M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1997) 3-20] to graphs with a fixed cyclomatic number, while this cannot be achieved for other classical generalizations of trees. We also introduce thek-edge-outerplanar graphs, a class of planar graphs with arbitrary (but bounded) tree-width that generalizes the cacti, and show that the integrality gap of the maximum edge-disjoint paths problem is bounded in these graphs.