activity
20162024
most citedMulti-Target Search in Euclidean Space with Ray Shooting (Full Version)

3 citations · 5 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2016★ 1 cited

A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem

Cédric Bentz, Pierre Le Bodic

Pruhs and Woeginger prove the existence of FPTAS's for a general class of minimization and maximization subset selection problems. Without losing generality from the original frame…