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


Arora, Sonika ; Chakaravarthy, Venkatesan T. ; Gupta, Kanika ; Gupta, Neelima ; Sabharwal, Yogish

Replica Placement on Directed Acyclic Graphs

pdf-format:
20.pdf (0.9 MB)


Abstract

The replica placement problem has been well studied on trees. In this paper, we study this problem on directed acyclic graphs. The replica placement problem on general DAGs generalizes the set cover problem. We present a constant factor approximation algorithm for the special case of DAGs having bounded degree and bounded tree-width (BDBT-DAGs). We also present a constant factor approximation algorithm for DAGs composed of local BDBT-DAGs connected in a tree like manner (TBDBT-DAGs). The latter class of DAGs generalizes trees as well; we improve upon the previously best known approximation ratio for the problem on trees. Our algorithms are based on the LP rounding technique; the core component of our algorithm exploits the structural properties of tree-decompositions to massage the LP solution into an integral solution.

BibTeX - Entry

@InProceedings{arora_et_al:LIPIcs:2014:4844,
  author =	{Sonika Arora and Venkatesan T. Chakaravarthy and Kanika Gupta and Neelima Gupta and Yogish Sabharwal},
  title =	{{Replica Placement on Directed Acyclic Graphs}},
  booktitle =	{34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
  pages =	{213--225},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-77-4},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{29},
  editor =	{Venkatesh Raman and S. P. Suresh},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4844},
  URN =		{urn:nbn:de:0030-drops-48449},
  doi =		{10.4230/LIPIcs.FSTTCS.2014.213},
  annote =	{Keywords: Approximation Algorithms, LP Rounding}
}

Keywords: Approximation Algorithms, LP Rounding
Seminar: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Issue Date: 2014
Date of publication: 11.12.2014


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