Location of Repository

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 − ɛ ≈ 0.5223 − ɛ for any constant ɛ> 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 − ɛ for any constant ɛ> 0).

Year: 2005

OAI identifier:
oai:CiteSeerX.psu:10.1.1.320.2413

Provided by:
CiteSeerX

Download PDF: