Approximation algorithms for geometric conflict free covering problems

DOI10.1016/j.comgeo.2019.101591zbMath1444.68272MaRDI QIDQ2206716

Saket Saurabh, Aritra Banik, Vibha Sahlot

Publication date: 23 October 2020

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2019.101591

zbMATH Keywords

conflicts; unit-disk graph; geometric covering; unit-interval graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W25: Approximation algorithms

05C62: Graph representations (geometric and intersection representations, etc.)