License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2013.263
URN: urn:nbn:de:0030-drops-43784
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4378/
Arora, Sonika ;
Chakaravarthy, Venkatesan T. ;
Gupta, Neelima ;
Mukherjee, Koyel ;
Sabharwal, Yogish
Replica Placement via Capacitated Vertex Cover
Abstract
In this paper, we study the replica placement problem on trees and present a constant factor approximation algorithm (with an additional additive constant factor). This improves the best known previous algorithm having an approximation ratio dependent on the maximum degree of the tree. Our techniques also extend to the partial cover version. Our algorithms are based on the LP rounding technique. The core component of our algorithm exploits a connection between the natural LP solutions of the replica placement problem and the capacitated vertex cover problem.
BibTeX - Entry
@InProceedings{arora_et_al:LIPIcs:2013:4378,
author = {Sonika Arora and Venkatesan T. Chakaravarthy and Neelima Gupta and Koyel Mukherjee and Yogish Sabharwal},
title = {{Replica Placement via Capacitated Vertex Cover}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages = {263--274},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-64-4},
ISSN = {1868-8969},
year = {2013},
volume = {24},
editor = {Anil Seth and Nisheeth K. Vishnoi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4378},
URN = {urn:nbn:de:0030-drops-43784},
doi = {10.4230/LIPIcs.FSTTCS.2013.263},
annote = {Keywords: Approximation Algorithms, LP Rounding}
}
Keywords: |
|
Approximation Algorithms, LP Rounding |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) |
Issue Date: |
|
2013 |
Date of publication: |
|
10.12.2013 |