Approximation algorithms for geometric conflict free covering problems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Aritra Banik, Vibha Sahlot, Saket Saurabh 0001. Approximation algorithms for geometric conflict free covering problems. Comput. Geom., 89:101591, 2020. [doi]

The following publications are possibly variants of this publication:

Parameterized Complexity of Geometric Covering Problems Having ConflictsAritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh. wads 2017: 61-72 [doi]

Parameterized Complexity of Geometric Covering Problems Having ConflictsAritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh 0001. algorithmica, 82(1):1-19, 2020. [doi]

runs on WebDSL