1 citations · 2 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 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…
cs.DM2016
On the edge capacitated Steiner tree problem
Cedric Bentz, Marie-Christine Costa, Alain Hertz
Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree pro…