License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.34
URN: urn:nbn:de:0030-drops-84090
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8409/
Go to the corresponding LIPIcs Volume Portal


Huang, Yi ; Janardhanan, Mano Vikash ; Reyzin, Lev

Network Construction with Ordered Constraints

pdf-format:
LIPIcs-FSTTCS-2017-34.pdf (0.5 MB)


Abstract

In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not reflected in previous, more general models. We give hardness of approximation results and nearly-matching upper bounds for the offline problem, and we study the online problem in both general graphs and restricted sub-classes. In the online problem, for general graphs, we give exponentially better upper bounds than exist for algorithms for general connectivity problems. For the restricted classes of stars and paths we are able to find algorithms with optimal competitive ratios, the latter of which involve analysis using a potential function defined over PQ-trees.

BibTeX - Entry

@InProceedings{huang_et_al:LIPIcs:2018:8409,
  author =	{Yi Huang and Mano Vikash Janardhanan and Lev Reyzin},
  title =	{{Network Construction with Ordered Constraints}},
  booktitle =	{37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
  pages =	{34:34--34:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-055-2},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{93},
  editor =	{Satya Lokam and R. Ramanujam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8409},
  URN =		{urn:nbn:de:0030-drops-84090},
  doi =		{10.4230/LIPIcs.FSTTCS.2017.34},
  annote =	{Keywords: subgraph connectivity, network construction, ordered connectivity constraints, PQ-trees}
}

Keywords: subgraph connectivity, network construction, ordered connectivity constraints, PQ-trees
Seminar: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Issue Date: 2018
Date of publication: 26.01.2018


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