An improved approximation algorithm for covering vertices by 4+-paths

Path cover is one of the well-known NP-hard problems that has received much attention. In this paper, we study a variant of path cover, denoted by MPC v 4 + , to cover as many vertices in a given graph G = ( V , E ) as possible by a collection of vertex-disjoint paths each of order four or above. Th...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 49; no. 3; p. 49
Main Authors: Gong, Mingyang, Chen, Zhi-Zhong, Lin, Guohui, Wang, Lusheng
Format: Journal Article
Language:English
Published: New York Springer US 01.04.2025
Springer Nature B.V
Subjects:
Algorithms
Apexes
Approximation
Combinatorics
Convex and Discrete Geometry
Graph theory
Matching
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Packing problem
Theory of Computation
Path cover
Maximum matching
Path-cycle cover
Recursion
Approximation algorithm
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Path cover is one of the well-known NP-hard problems that has received much attention. In this paper, we study a variant of path cover, denoted by MPC v 4 + , to cover as many vertices in a given graph G = ( V , E ) as possible by a collection of vertex-disjoint paths each of order four or above. The problem admits an existing O ( | V | 8 ) -time 2-approximation algorithm by applying several time-consuming local improvement operations (Gong et al.: Proceedings of MFCS 2022, LIPIcs 241, pp 53:1–53:14, 2022). In contrast, our new algorithm uses a completely different method and it is an improved O ( min { | E | 2 | V | 2 , | V | 5 } ) -time 1.874-approximation algorithm, which answers the open question in Gong et al. (2022) in the affirmative. An important observation leading to the improvement is that the number of vertices in a maximum matching M of G is relatively large compared to that in an optimal solution of MPC v 4 + . Our new algorithm forms a feasible solution of MPC v 4 + from a maximum matching M by computing a maximum-weight path-cycle cover in an auxiliary graph to connect as many edges in M as possible.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01279-2