All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

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

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Theory of Computing Systems

  • ISSN

    1432-4350

  • e-ISSN

  • Volume of the periodical

    53

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    23

  • Pages from-to

    341-363

  • UT code for WoS article

    000320040400010

  • EID of the result in the Scopus database