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

DOI10.1007/S00224-013-9454-3zbMATH Open1273.05094OpenAlexW2135615874MaRDI QIDQ372974FDOQ372974

Authors: 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/

Recommendations

• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
• Approximate duality of multicommodity multiroute flows and cuts: single source case
• Single source multiroute flows and cuts on uniform capacity networks
• Single source multiroute flows and cuts on uniform capacity networks
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

zbMATH Keywords

approximation algorithmsdualitymulticommodity flow

Mathematics Subject Classification ID

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

Cites Work

• Maximal Flow Through a Network
• The design of approximation algorithms
• The geometry of graphs and some of its algorithmic applications
• The Complexity of Multiterminal Cuts
• Title not available (Why is that?)
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• On multiroute maximum flows in networks.
• Single source multiroute flows and cuts on uniform capacity networks
• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
• Length-bounded cuts and flows
• Algorithms for 2-Route Cut Problems
• Region growing for multi-route cuts
• Approximate duality of multicommodity multiroute flows and cuts: single source case

Cited In (6)

• Single source multiroute flows and cuts on uniform capacity networks
• Approximate duality of multicommodity multiroute flows and cuts: single source case
• An approximation algorithm for multiroute flow decomposition
• Multiroute flows: cut-trees and realizability
• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
• Single source multiroute flows and cuts on uniform capacity networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372974)