Submodular unsplittable flow on trees

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

  • University of Copenhagen
  • Max Planck Institute for Informatics
  • University of Warwick

Abstract

We study the Unsplittable Flow problem ((Formula presented.)) 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 (Formula presented.)-approximation algorithm for Submodular UFP on trees where k denotes the pathwidth of the given tree. Since every tree has pathwidth (Formula presented.), we obtain an (Formula presented.) approximation for arbitrary trees. This is the first non-trivial approximation guarantee for the problem, matching the best known approximation ratio 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. (2014, FOCS), Anagnostopoulos et al. (Amazing 2+(Formula presented.) approximation for unsplittable flow on a path, SIAM, pp 26–41, 2014) for UFP on paths with a linear objective. Our relaxation is very structured, so it can be combined with the contention resolution framework of Chekuri et al. (2009, STOC). 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. (A quasi-PTAS for unsplittable flow on line graphs, ACM, pp 721–729, 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 (Formula presented.)-hard if the input data is arbitrary.

Details

Original languageEnglish
Pages (from-to)565–589
JournalMathematical Programming
Volume172
Issue number1-2
Publication statusPublished - Nov 2018
MoE publication typeA1 Journal article-refereed

    Research areas

  • Approximation algorithms, Submodular functions, Unsplittable flow problem

Download statistics

No data available

ID: 18000936