Submodular unsplittable flow on trees

Anna Adamaszek, Parinya Chalermsook*, Alina Ene, Andreas Wiese

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

5 Citations (Scopus)

Abstract

We study the Unsplittable Flow problem (UFP) on trees with a submodular objective function. The input to this problem is a tree with edge capacities and a collection of tasks, each characterized by a source node, a sink node, and a demand. A subset of the tasks is feasible if the tasks can simultaneously send their demands from the source to the sink without violating the edge capacities. The goal is to select a feasible subset of the tasks that maximizes a submodular objective function. Our main result is an O(k log n)-approximation algorithm for Submodular UFP on trees where k denotes the pathwidth of the given tree. Since every tree has pathwidth O(log n), we obtain an O(log2 n) approximation for arbitrary trees. This is the first non-trivial approximation guarantee for the problem and it matches the best approximation known for UFP on trees with a linear objective function. Our main technical contribution is a new geometric relaxation for UFP on trees that builds on the recent work of [Bonsma et al., FOCS 2011; Anagnostopoulos et al., SODA 2014] for UFP on paths with a linear objective. Our relaxation is very structured and we can combine it with the contention resolution framework of [Chekuri et al., STOC 2011]. Our approach is robust and extends to several related problems, such as UFP with bag constraints and the Storage Allocation Problem. Additionally, we study the special case of UFP on trees with a linear objective and upward instances where, for each task, the source node is a descendant of the sink node. Such instances generalize UFP on paths. We build on the work of [Bansal et al., STOC 2006] for UFP on paths and obtain a QPTAS for upward instances when the input data is quasi-polynomially bounded. We complement this result by showing that, unlike the path setting, upward instances are APX-hard if the input data is arbitrary.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Proceedings
PublisherSpringer Verlag
Pages337-349
Number of pages13
ISBN (Print)9783319334608
DOIs
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventConference on Integer Programming and Combinatorial Optimization - Liege, Belgium
Duration: 1 Jun 20163 Jun 2016
Conference number: 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9682
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

ConferenceConference on Integer Programming and Combinatorial Optimization
Abbreviated titleIPCO
CountryBelgium
CityLiege
Period01/06/201603/06/2016

Fingerprint Dive into the research topics of 'Submodular unsplittable flow on trees'. Together they form a unique fingerprint.

Cite this