A Deterministic Approximation Algorithm for Maximum 2-Path Packing

被引：10
|
作者：
Tanahashi, Ruka [1 ]
Chen, Zhi-Zhong [1 ]
机构：
[1] Tokyo Denki Univ, Dept Math Sci, Tokyo 3500394, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2010年 / E93D卷 / 02期
关键词：
2-path packing problem; approximation algorithm; derandomization; pessimistic estimator method; TRIANGLE PACKING;
D O I：
10.1587/transinf.E93.D.241
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of 35/67 - epsilon approximate to 0.5223 - epsilon for any constant epsilon > 0. We refine their algorithm and derandomize it to obtain a deterministic cubic-time approximation algorithm for the problem which achieves a better ratio (namely, 0.5265 - epsilon for any constant epsilon > 0).
引用
收藏
页码：241 / 249
页数：9
相关论文
共 50 条
12345