Local Improvement Algorithms For A Path Packing Problem: A Performance Analysis Based On Linear Programming

K.M.J. de Bontridder,B.V. Halldórsson,M.M. Halldórsson,Cor Hurkens,Jan Karel Lenstra,R. Ravi,Leen Stougie

OPERATIONS RESEARCH LETTERS（2021）

引用 1|浏览33

暂无评分

摘要

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. (c) 2020 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

查看译文

关键词

Path packing, Greedy algorithm, Local search, Performance guarantee, Linear programming

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要