License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2022.20
URN: urn:nbn:de:0030-drops-169582
URL: https://drops.dagstuhl.de/opus/volltexte/2022/16958/
Go to the corresponding LIPIcs Volume Portal


Blankenburg, Daniel

Resource Sharing Revisited: Local Weak Duality and Optimal Convergence

pdf-format:
LIPIcs-ESA-2022-20.pdf (0.9 MB)


Abstract

We revisit the (block-angular) min-max resource sharing problem, which is a well-known generalization of fractional packing and the maximum concurrent flow problem. It consists of finding an ๐“_โˆž-minimal element in a Minkowski sum ๐’ณ = โˆ‘_{C โˆˆ ๐’ž} X_C of non-empty closed convex sets X_C โŠ† โ„^โ„›_{โ‰ฅ 0}, where ๐’ž and โ„› are finite sets. We assume that an oracle for approximate linear minimization over X_C is given.
We improve on the currently fastest known FPTAS in various ways. A major novelty of our analysis is the concept of local weak duality, which illustrates that the algorithm optimizes (close to) independent parts of the instance separately. Interestingly, this implies that the computed solution is not only approximately ๐“_{โˆž}-minimal, but among such solutions, also its second-highest entry is approximately minimal.
Based on a result by Klein and Young [Klein and Young, 2015], we provide a lower bound of ฮฉ((๐’ž|+|โ„›|)/ฮดยฒ log |โ„›|) required oracle calls for a natural class of algorithms. Our FPTAS is optimal within this class - its running time matches the lower bound precisely, and thus improves on the previously best-known running time for the primal as well as the dual problem.

BibTeX - Entry

@InProceedings{blankenburg:LIPIcs.ESA.2022.20,
  author =	{Blankenburg, Daniel},
  title =	{{Resource Sharing Revisited: Local Weak Duality and Optimal Convergence}},
  booktitle =	{30th Annual European Symposium on Algorithms (ESA 2022)},
  pages =	{20:1--20:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-247-1},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{244},
  editor =	{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16958},
  URN =		{urn:nbn:de:0030-drops-169582},
  doi =		{10.4230/LIPIcs.ESA.2022.20},
  annote =	{Keywords: Resource sharing, Dantzig-Wolfe-type algorithms, Decreasing minimization}
}

Keywords: Resource sharing, Dantzig-Wolfe-type algorithms, Decreasing minimization
Collection: 30th Annual European Symposium on Algorithms (ESA 2022)
Issue Date: 2022
Date of publication: 01.09.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI