Approximation algorithms for geometric conflict free covering problems

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

Saket Saurabh, Vibha Sahlot, Aritra Banik

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

conflictsunit-disk graphgeometric coveringunit-interval graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved results on geometric hitting set problems
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Geometric Avatar Problems
• Choice Is Hard
• Fréchet Distance Between a Line and Avatar Point Set
• Some optimal inapproximability results
• Parameterized complexity of geometric covering problems having conflicts

This page was built for publication: Approximation algorithms for geometric conflict free covering problems