Approximation algorithms for geometric conflict free covering problems
Computational Geometry(2020)
摘要
In the Geometric Conflict Free Covering, we are given a set of points P, a set of closed geometric objects O and a conflict graph CGO with O as vertex set. An edge (Oi,Oj) in CGO denotes conflict between Oi and Oj and at most one among these can be part of any feasible solution. A set of objects is conflict free if they form an independent set in CGO. The objective is to find a conflict free set of objects that maximizes the number of points covered.
更多查看译文
关键词
Conflicts,Geometric covering,Unit interval graph,Unit disk graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要