1 research outputs found
A local search -approximation algorithm for the minimum -path partition problem
Given a graph , the -path partition problem is to find a
minimum collection of vertex-disjoint paths each of order at most to cover
all the vertices of . It is different from but closely related to the
well-known -set cover problem. The best known approximation algorithm for
the -path partition problem was proposed recently and has a ratio .
Here we present a local search algorithm and show, by an amortized analysis,
that it is a -approximation. This ratio matches up to the best
approximation ratio for the -set cover problem.Comment: 16 pages, 21 figure