3 citations · 6 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
PTAS for Steiner Tree on Map Graphs
Jarosław Byrka, Mateusz Lewandowski, Syed Mohammad Meesum +2
We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map grap…
cs.DS2019★ 3 cited
Concave connection cost Facility Location and the Star Inventory Routing problem
Jarosław Byrka, Mateusz Lewandowski
We study a variant of the uncapacitated facility location problem (UFL), where connection costs of clients are defined by (client specific) concave nondecreasing functions of the c…