activity
20162023
most citedConcave connection cost Facility Location and the Star Inventory Routing problem

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

collaborators
Showing 2016Show all

1 paper · 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…