@article{f976d86231cd43abb01334c9580b76d3,
title = "Local improvement algorithms for a path packing problem: a performance analysis based on linear programming",
abstract = "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.",
keywords = "Greedy algorithm, Linear programming, Local search, Path packing, Performance guarantee",
author = "\{De Bontridder\}, \{Koen M.J.\} and B.V. Halld{\'o}rsson and Halld{\'o}rsson, \{Magn{\'u}s M.\} and Hurkens, \{Cor A.J.\} and J.K. Lenstra and R. Ravi and L. Stougie",
year = "2021",
month = jan,
doi = "10.1016/j.orl.2020.11.005",
language = "English",
volume = "49",
pages = "62--68",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier B.V.",
number = "1",
}