28 citations · 62 across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CG2016
Approximation Schemes for Geometric Coverage Problems
Steven Chaplick, Minati De, Alexander Ravsky +1
In their seminal work, Mustafa and Ray (2009) showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search -- this is one of the most general approac…
cs.DS2016
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
We study the classical NP-hard problems of finding maximum-size subsets from given sets of terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint p…