2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2019
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
Andrés Fielbaum, Ignacio Morales, José Verschae
Obtaining strong linear relaxations of capacitated covering problems constitute a major technical challenge even for simple settings. For one of the most basic cases, the Knapsack-…
cs.DS2016★ 2 cited
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
Maurice Cheung, Julián Mestre, David B. Shmoys +1
We consider the following single-machine scheduling problem, which is often denoted : we are given jobs to be scheduled on a single machine, where each job h…