3 citations · 3 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016★ 3 cited
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs
Jarosław Byrka, Mateusz Lewandowski, Carsten Moldenhauer
We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LM…
cs.DS2010
Balanced Interval Coloring
Antonios Antoniadis, Falk Hüffner, Pascal Lenzner +2
We consider the discrepancy problem of coloring intervals with colors such that at each point on the line, the maximal difference between the number of intervals of any two…