License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.52
URN: urn:nbn:de:0030-drops-63335
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6333/
Go to the corresponding LIPIcs Volume Portal


Mahoney, Michael W. ; Rao, Satish ; Wang, Di ; Zhang, Peng

Approximating the Solution to Mixed Packing and Covering LPs in Parallel Oś(epsilon^{-3}) Time

pdf-format:
LIPIcs-ICALP-2016-52.pdf (0.5 MB)


Abstract

We study the problem of approximately solving positive linear programs (LPs). This class of LPs models a wide range of fundamental problems in combinatorial optimization and operations research, such as many resource allocation problems, solving non-negative linear systems, computing tomography, single/multi commodity flows on graphs, etc. For the special cases of pure packing or pure covering LPs, recent result by Allen-Zhu and Orecchia [Allen/Zhu/Orecchia, SODA'15] gives Oś(1/(epsilon^3))-time parallel algorithm, which breaks the longstanding Oś(1/(epsilon^4)) running time bound by the seminal work of Luby and Nisan [Luby/Nisan, STOC'93]. We present new parallel algorithm with running time Oś(1/(epsilon^3)) for the more general mixed packing and covering LPs, which improves upon the Oś(1/(epsilon^4))-time algorithm of Young [Young, FOCS'01; Young, arXiv 2014]. Our work leverages the ideas from both the optimization oriented approach [Allen/Zhu/Orecchia, SODA'15; Wang/Mahoney/Mohan/Rao, arXiv 2015], as well as the more combinatorial approach with phases [Young, FOCS'01; Young, arXiv 2014]. In addition, our algorithm, when directly applied to pure packing or pure covering LPs, gives a improved running time of Oś(1/(epsilon^2)).

BibTeX - Entry

@InProceedings{mahoney_et_al:LIPIcs:2016:6333,
  author =	{Michael W. Mahoney and Satish Rao and Di Wang and Peng Zhang},
  title =	{{Approximating the Solution to Mixed Packing and Covering LPs in Parallel Oś(epsilon^{-3}) Time}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{52:1--52:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6333},
  URN =		{urn:nbn:de:0030-drops-63335},
  doi =		{10.4230/LIPIcs.ICALP.2016.52},
  annote =	{Keywords: Mixed packing and covering, Linear program, Approximation algorithm, Parallel algorithm}
}

Keywords: Mixed packing and covering, Linear program, Approximation algorithm, Parallel algorithm
Seminar: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Issue Date: 2016
Date of publication: 17.08.2016


DROPS-Home | Imprint | Privacy Published by LZI