Matches in SemOpenAlex for { <https://semopenalex.org/work/W2119862441> ?p ?o ?g. }
- W2119862441 abstract "We consider the all-or-nothing multicommodity flow problem in general graphs. We are given a capacitated undirected graph G=(V,E,u) and set of k pairs s1t1, s2t2, …, sktk. Each pair has a unit demand. The objective is to find a largest subset S of 1,2,…,k such that for every i in S we can send a flow of one unit between si and ti. Note that this differs from the edge-disjoint path problem (EDP) in that we do not insist on integral flows for the pairs. This problem is NP-hard, and APX-hard, even on trees. For trees, a 2--approximation is known for the cardinality case and a 4--approximation for the weighted case. In this paper we build on a recent result of Racke on low congestion oblivious routing in undirected graphs to obtain a poly-logarithmic approximation for the all-or-nothing problem in general undirected graphs. The best previous known approximation for all-or-nothing flow problem was O(min(n" @default.
- W2119862441 created "2016-06-24" @default.
- W2119862441 creator A5036503505 @default.
- W2119862441 creator A5039619350 @default.
- W2119862441 creator A5044801840 @default.
- W2119862441 date "2004-01-01" @default.
- W2119862441 modified "2023-10-18" @default.
- W2119862441 title "The all-or-nothing multicommodity flow problem" @default.
- W2119862441 cites W1559202792 @default.
- W2119862441 cites W1563039933 @default.
- W2119862441 cites W1567467079 @default.
- W2119862441 cites W1569752386 @default.
- W2119862441 cites W1589172288 @default.
- W2119862441 cites W1591562949 @default.
- W2119862441 cites W1593787329 @default.
- W2119862441 cites W1921591048 @default.
- W2119862441 cites W1949395038 @default.
- W2119862441 cites W1963964297 @default.
- W2119862441 cites W1971443646 @default.
- W2119862441 cites W1994495069 @default.
- W2119862441 cites W1996073274 @default.
- W2119862441 cites W1999867351 @default.
- W2119862441 cites W2001532889 @default.
- W2119862441 cites W2003160050 @default.
- W2119862441 cites W2004322147 @default.
- W2119862441 cites W2011764853 @default.
- W2119862441 cites W2019062750 @default.
- W2119862441 cites W2020066367 @default.
- W2119862441 cites W2022191808 @default.
- W2119862441 cites W2034269606 @default.
- W2119862441 cites W2042276676 @default.
- W2119862441 cites W2080283527 @default.
- W2119862441 cites W2084706168 @default.
- W2119862441 cites W2088961276 @default.
- W2119862441 cites W2096909875 @default.
- W2119862441 cites W2100699015 @default.
- W2119862441 cites W2104685111 @default.
- W2119862441 cites W2107881198 @default.
- W2119862441 cites W2135424293 @default.
- W2119862441 cites W2136558412 @default.
- W2119862441 cites W2139739478 @default.
- W2119862441 cites W2145818650 @default.
- W2119862441 cites W2150148016 @default.
- W2119862441 cites W2154571828 @default.
- W2119862441 cites W2156867662 @default.
- W2119862441 cites W2160167461 @default.
- W2119862441 cites W2171868840 @default.
- W2119862441 cites W2176446742 @default.
- W2119862441 cites W3014052784 @default.
- W2119862441 doi "https://doi.org/10.1145/1007352.1007383" @default.
- W2119862441 hasPublicationYear "2004" @default.
- W2119862441 type Work @default.
- W2119862441 sameAs 2119862441 @default.
- W2119862441 citedByCount "72" @default.
- W2119862441 countsByYear W21198624412012 @default.
- W2119862441 countsByYear W21198624412013 @default.
- W2119862441 countsByYear W21198624412014 @default.
- W2119862441 countsByYear W21198624412016 @default.
- W2119862441 countsByYear W21198624412017 @default.
- W2119862441 countsByYear W21198624412018 @default.
- W2119862441 countsByYear W21198624412019 @default.
- W2119862441 countsByYear W21198624412020 @default.
- W2119862441 countsByYear W21198624412021 @default.
- W2119862441 countsByYear W21198624412022 @default.
- W2119862441 countsByYear W21198624412023 @default.
- W2119862441 crossrefType "proceedings-article" @default.
- W2119862441 hasAuthorship W2119862441A5036503505 @default.
- W2119862441 hasAuthorship W2119862441A5039619350 @default.
- W2119862441 hasAuthorship W2119862441A5044801840 @default.
- W2119862441 hasBestOaLocation W21198624412 @default.
- W2119862441 hasConcept C114614502 @default.
- W2119862441 hasConcept C114809511 @default.
- W2119862441 hasConcept C118615104 @default.
- W2119862441 hasConcept C124101348 @default.
- W2119862441 hasConcept C132525143 @default.
- W2119862441 hasConcept C134306372 @default.
- W2119862441 hasConcept C148764684 @default.
- W2119862441 hasConcept C170334043 @default.
- W2119862441 hasConcept C2524010 @default.
- W2119862441 hasConcept C3018234147 @default.
- W2119862441 hasConcept C31258907 @default.
- W2119862441 hasConcept C33923547 @default.
- W2119862441 hasConcept C38349280 @default.
- W2119862441 hasConcept C39927690 @default.
- W2119862441 hasConcept C41008148 @default.
- W2119862441 hasConcept C45340560 @default.
- W2119862441 hasConcept C74172769 @default.
- W2119862441 hasConcept C87117476 @default.
- W2119862441 hasConceptScore W2119862441C114614502 @default.
- W2119862441 hasConceptScore W2119862441C114809511 @default.
- W2119862441 hasConceptScore W2119862441C118615104 @default.
- W2119862441 hasConceptScore W2119862441C124101348 @default.
- W2119862441 hasConceptScore W2119862441C132525143 @default.
- W2119862441 hasConceptScore W2119862441C134306372 @default.
- W2119862441 hasConceptScore W2119862441C148764684 @default.
- W2119862441 hasConceptScore W2119862441C170334043 @default.
- W2119862441 hasConceptScore W2119862441C2524010 @default.
- W2119862441 hasConceptScore W2119862441C3018234147 @default.
- W2119862441 hasConceptScore W2119862441C31258907 @default.
- W2119862441 hasConceptScore W2119862441C33923547 @default.