Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10159252" target="_blank" >RIV/00216208:11320/13:10159252 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s00224-013-9454-3" target="_blank" >http://dx.doi.org/10.1007/s00224-013-9454-3</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00224-013-9454-3" target="_blank" >10.1007/s00224-013-9454-3</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing

Popis výsledku v původním jazyce

An elementary h-route flow, for an integer ha parts per thousand yen1, is a set of h edge-disjoint paths between a source and a sink, each path carrying a unit of flow, and an h-route flow is a non-negative linear combination of elementary h-route flows.An h-route cut is a set of edges whose removal decreases the maximum h-route flow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theoremfor multicommodity h-route cuts and flows, for ha parts per thousand currency sign3: The size of a minimum h-route cut is at least f/h and at most O(log(4) ka <...f) where f is the size of the maximum h-route flow and k is the number of commodities. Themain step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h=3 that has an approximation ratio of O(log(4) k). Previously, polylogarithmic a

Název v anglickém jazyce

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing

Popis výsledku anglicky

An elementary h-route flow, for an integer ha parts per thousand yen1, is a set of h edge-disjoint paths between a source and a sink, each path carrying a unit of flow, and an h-route flow is a non-negative linear combination of elementary h-route flows.An h-route cut is a set of edges whose removal decreases the maximum h-route flow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theoremfor multicommodity h-route cuts and flows, for ha parts per thousand currency sign3: The size of a minimum h-route cut is at least f/h and at most O(log(4) ka <...f) where f is the size of the maximum h-route flow and k is the number of commodities. Themain step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h=3 that has an approximation ratio of O(log(4) k). Previously, polylogarithmic a

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theory of Computing Systems

ISSN

1432-4350

e-ISSN

—

Svazek periodika

53

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

23

Strana od-do

341-363

Kód UT WoS článku

000320040400010

EID výsledku v databázi Scopus

—