A 3/2-approximation algorithm for some minimum-cost graph problems

• 成果类型: Article; Proceedings Paper
• 署名作者: Couetoux, Basile; Davis, James M.; Williamson, David P.
• 署名单位: Aix-Marseille Universite; Cornell University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-013-0727-z
• 发表日期: 2015
• 页码: 19-34
• 关键词: constrained forest problem; approximation; TREE

摘要

We consider a class of graph problems introduced in a paper of Goemans and Williamson that involve finding forests of minimum edge cost. This class includes a number of location/routing problems; it also includes a problem in which we are given as input a parameter , and want to find a forest such that each component has at least vertices. Goemans and Williamson gave a 2-approximation algorithm for this class of problems. We give an improved 3/2-approximation algorithm.