Revision as of 10:54, 30 June 2025 edit OAbot (talk \| contribs) Bots 646,409 edits m Open access bot: url-access=subscription updated in citation with #oabot. ← Previous edit		Latest revision as of 09:34, 1 September 2025 edit undo OAbot (talk \| contribs) Bots 646,409 edits m Open access bot: url-access=subscription updated in citation with #oabot.
Line 64: === Conflict-free covering === A more general notion is '''conflict-free covering'''.<ref>{{Cite journal\|last1=Banik\|first1=Aritra\|last2=Sahlot\|first2=Vibha\|last3=Saurabh\|first3=Saket\|date=2020-08-01\|title=Approximation algorithms for geometric conflict free covering problems\|url=http://www.sciencedirect.com/science/article/pii/S0925772119301324\|journal=Computational Geometry\|language=en\|volume=89\|pages=101591\|doi=10.1016/j.comgeo.2019.101591\|s2cid=209959954 \|issn=0925-7721\|url-access=subscription}}</ref> In this problem: * There is a set ''O'' of ''m'' objects, and a conflict-graph ''G<sub>O</sub>'' on ''O''.

Covering problems: Difference between revisions