文章基本信息

标题：Replica Placement via Capacitated Vertex Cover
本地全文：下载
作者：Sonika Arora ; Venkatesan T. Chakaravarthy ; Neelima Gupta 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2013
卷号：24
页码：263-274
DOI：10.4230/LIPIcs.FSTTCS.2013.263
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Approximation Algorithms; LP Rounding