2026-08-16T23:49:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4378 2024-03-06T10:34:58Z ddc:004 open_access

Replica Placement via Capacitated Vertex Cover Arora, Sonika Chakaravarthy, Venkatesan T. Gupta, Neelima Mukherjee, Koyel Sabharwal, Yogish Approximation Algorithms LP Rounding 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sonika Arora and Venkatesan T. Chakaravarthy and Neelima Gupta and Koyel Mukherjee and Yogish Sabharwal 2013 Is Part Of LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2013.263 urn:nbn:de:0030-drops-43784 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.263 eng https://creativecommons.org/licenses/by/3.0/legalcode