Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing

DOI10.1007/s00224-013-9454-3zbMath1273.05094OpenAlexW2135615874MaRDI QIDQ372974

Petr Kolman, Christian Scheideler

Publication date: 21 October 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3005/

zbMATH Keywords

dualityapproximation algorithmsmulticommodity flow

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The geometry of graphs and some of its algorithmic applications
• On multiroute maximum flows in networks
• The Design of Approximation Algorithms
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Length-bounded cuts and flows
• Maximal Flow Through a Network
• Algorithms for 2-Route Cut Problems
• The Complexity of Multiterminal Cuts
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

This page was built for publication: Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing