Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - Given an integer $h$, a graph $G=(V,E)$ with arbitrary positive edge capacities and $k$ pairs of vertices $(s_1,t_1), (s_2,t_2), \ldots, (s_k,t_k)$, called terminals, an $h$-route cut is a set $F\subseteq E$ of edges such that after the removal of the edges in $F$ no pair $s_i-t_i$ is connected by $h$ edge-disjoint paths (i.e., the connectivity of every $s_i-t_i$ pair is at most $h-1$ in $(V,E\setminus F)$). The $h$-route cut is a natural generalization of the classical cut problem for multicommodity flows (take $h=1$). The main result of this paper is an $O(h^5 2^{2h} (h+\log k)^2)$-approximation algorithm for the minimum $h$-route cut problem in the case that $s_1=s_2=\cdots=s_k$, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicommodity flows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.
- Given an integer $h$, a graph $G=(V,E)$ with arbitrary positive edge capacities and $k$ pairs of vertices $(s_1,t_1), (s_2,t_2), \ldots, (s_k,t_k)$, called terminals, an $h$-route cut is a set $F\subseteq E$ of edges such that after the removal of the edges in $F$ no pair $s_i-t_i$ is connected by $h$ edge-disjoint paths (i.e., the connectivity of every $s_i-t_i$ pair is at most $h-1$ in $(V,E\setminus F)$). The $h$-route cut is a natural generalization of the classical cut problem for multicommodity flows (take $h=1$). The main result of this paper is an $O(h^5 2^{2h} (h+\log k)^2)$-approximation algorithm for the minimum $h$-route cut problem in the case that $s_1=s_2=\cdots=s_k$, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicommodity flows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems. (en)
|
Title
| - Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
- Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case (en)
|
skos:prefLabel
| - Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
- Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case (en)
|
skos:notation
| - RIV/00216208:11320/12:10129396!RIV13-GA0-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1M0545), P(GA201/09/0197)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/12:10129396
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - approximation algorithms; graph; cut; flow; Duality (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proc. of 23 ACM-SIAM Symposium on Discrete Algorithms
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Kolman, Petr
- Scheideler, Christian
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
issn
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - Society for Industrial and Applied Mathematics.
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |