4 citations · 4 across the 2 of their papers we have counts for
2 papers
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…
cs.CC2008
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm…