The Library
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Tools
Tools
Tools
Chekuri, Chandra and Ene, Alina (2014) The all-or-nothing flow problem in directed graphs with symmetric demand pairs. In: Lee, Jon and Vygen, Jens, (eds.) Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014 : proceedings. Lecture notes in computer science (Number 8494). Springer International Publishing, pp. 222-233. ISBN 9783319075563
|
PDF
WRAP_Ene_dir-anf.pdf - Accepted Version - Requires a PDF viewer. Download (633Kb) | Preview |
Official URL: http://dx.doi.org/10.1007/978-3-319-07557-0_19
Abstract
We study the approximability of the All-or-Nothing multicommodity flow problem in directed graphs with symmetric demand pairs (SymANF). The input consists of a directed graph G = (V, E) and a collection of (unordered) pairs of nodes M={s1t1,s2t2,…,sktk}. A subset M′ of the pairs is routable if there is a feasible multicommodity flow in G such that, for each pair siti∈M′, the amount of flow from s i to t i is at least one and the amount of flow from t i to s i is at least one. The goal is to find a maximum cardinality subset of the given pairs that can be routed. Our main result is a poly-logarithmic approximation with constant congestion for SymANF. We obtain this result by extending the well-linked decomposition framework of [6] to the directed graph setting with symmetric demand pairs. We point out the importance of studying routing problems in this setting and the relevance of our result to future work.
| Item Type: | Book Item | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Directed graphs | ||||
| Series Name: | Lecture notes in computer science | ||||
| Publisher: | Springer International Publishing | ||||
| ISBN: | 9783319075563 | ||||
| ISSN: | 0302-9743 | ||||
| Book Title: | Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014 : proceedings | ||||
| Editor: | Lee, Jon and Vygen, Jens | ||||
| Official Date: | 2014 | ||||
| Dates: |
|
||||
| Number: | Number 8494 | ||||
| Page Range: | pp. 222-233 | ||||
| DOI: | 10.1007/978-3-319-07557-0_19 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Date of first compliant deposit: | 27 March 2016 | ||||
| Date of first compliant Open Access: | 27 March 2016 | ||||
| Funder: | National Science Foundation (U.S.) (NSF), Toyota Technological Institute at Chicago (TTI) | ||||
| Grant number: | CCF-1016684 (NSF), CCF-1319376 (NSF), CCF-0844872 (NSF) | ||||
| Version or Related Resource: | Chekuri, C. and Ene, A. (2014). The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Mathematical Programming Series B. | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
