A local search algorithm for the \(k\)-path partition problem

DOI10.1007/s11590-023-01989-8OpenAlexW4322506695MaRDI QIDQ6181375

Shiming Li, Zhaohui Liu, Wei Yu

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-01989-8

zbMATH Keywords

approximation algorithmlocal searchset coveringpath partition

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-path partitions in trees
• On the \(k\)-path partition of graphs.
• A boundary class for the \(k\)-path partition problem
• Maximum skew-symmetric flows and matchings
• A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
• An improved approximation algorithm for the minimum 3-path partition problem
• The path partition problem and related problems in bipartite graphs
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
• On the completeness of a generalized matching problem
• A 21/16-Approximation for the Minimum 3-Path Partition Problem
• Approximation algorithms for the directed path partition problems

This page was built for publication: A local search algorithm for the \(k\)-path partition problem