4 citations · 6 across the 14 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009
PTAS for k-tour cover problem on the plane for moderately large values of k
Anna Adamaszek, Artur Czumaj, Andrzej Lingas
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem…
cs.CC2009★ 4 cited
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
Piotr Berman, Marek Karpinski, Andrzej Lingas
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time e…