Minimum membership hitting sets of axis parallel segments

DOI10.1007/978-3-319-94776-1_53MaRDI QIDQ1791030zbMATH OpenOpenAlexFDO

Authors N. S. Narayanaswamy, S. M. Dhannya, C. Ramya

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_53

Mathematics Subject Classification ID

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

Recommendations

• Minimum membership covering and hitting
• Minimum membership covering and hitting
• On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line
• New results on a family of geometric hitting set problems in the plane
• Near-linear approximation algorithms for geometric hitting sets

Cited in

(7)

• Minimum hitting set of interval bundles problem: computational complexity and approximability
• Minimum membership covering and hitting
• Parameterized complexity of minimum membership dominating set
• Exactly hittable interval graphs
• Minimum-membership geometric dominating set: complexity and algorithms
• Algorithms for minimum membership dominating set problem
• On the complexity of minimum membership dominating set

This page was built for publication: Minimum membership hitting sets of axis parallel segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791030)