Local improvement algorithms for a path packing problem: A performance analysis based on linear programming

Given a graph, we wish to find a maximum number of vertex-disjoint paths of length 2. We propose a series of local improvement algorithms for this problem, and present a linear-programming based method for analyzing their performance.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 49; no. 1; pp. 62 - 68
Main Authors De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.2021
Elsevier
Subjects
Computer Science
Greedy algorithm
Linear programming
Local search
Path packing
Performance guarantee
Greedy algorithm
Local search
Performance guarantee
Linear programming
Path packing
Online AccessGet full text

Cover

More Information
Summary:Given a graph, we wish to find a maximum number of vertex-disjoint paths of length 2. We propose a series of local improvement algorithms for this problem, and present a linear-programming based method for analyzing their performance.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2020.11.005