Improved approximation algorithms for the k-path partition problem

Shiming Li (), Wei Yu () and Zhaohui Liu ()
Additional contact information
Shiming Li: East China University of Science and Technology
Wei Yu: East China University of Science and Technology
Zhaohui Liu: East China University of Science and Technology

Journal of Global Optimization, 2024, vol. 90, issue 4, No 8, 983-1006

Abstract: Abstract The k-path partition problem (kPP), defined on a graph $$G=(V,E)$$ G = ( V , E ) , is a well-known NP-hard problem when $$k\ge 3$$ k ≥ 3 . The goal of the kPP is to find a minimum collection of vertex-disjoint paths to cover all the vertices in G such that the number of vertices on each path is no more than k. In this paper, we give two approximation algorithms for the kPP. The first one, called Algorithm 1, uses an algorithm for the (0,1)-weighted maximum traveling salesman problem as a subroutine. When G is undirected, the approximation ratio of Algorithm 1 is $$\frac{k+12}{7} -\frac{6}{7k} $$ k + 12 7 - 6 7 k , which improves on the previous best-known approximation algorithm for every $$k\ge 7$$ k ≥ 7 . When G is directed, Algorithm 1 is a $$\left( \frac{k+6}{4} -\frac{3}{4k}\right) $$ k + 6 4 - 3 4 k -approximation algorithm, which improves the existing best available approximation algorithm for every $$k\ge 10$$ k ≥ 10 . Our second algorithm, i.e. Algorithm 2, is a local search algorithm tailored for the kPP in undirected graphs with small k. Algorithm 2 improves on the approximation ratios of the best available algorithm for every $$k=4,5,6$$ k = 4 , 5 , 6 . Combined with Algorithms 1 and 2, we have improved the approximation ratio for the kPP in undirected graphs for each $$k\ge 4$$ k ≥ 4 as well as the approximation ratio for the kPP in directed graphs for each $$k\ge 10$$ k ≥ 10 . As for the negative side, we show that for any $$\epsilon >0$$ ϵ > 0 it is NP-hard to approximate the kPP (with k being part of the input) within the ratio $$O(k^{1-\epsilon })$$ O ( k 1 - ϵ ) , which implies that Algorithm 1 is asymptotically optimal.

Keywords: Approximation algorithm; Path partition problem; Maximum traveling salesman problem; Local search (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-024-01428-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:90:y:2024:i:4:d:10.1007_s10898-024-01428-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-024-01428-7

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().