Geometric hitting set for line-constrained disks

DOI10.1007/978-3-031-38906-1_38arXiv2305.09045MaRDI QIDQ6139038

No author found.

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.09045

zbMATH Keywords

coveragediskshitting setline-constrained

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Exact algorithms and APX-hardness results for geometric packing and covering problems
• Improved results on geometric hitting set problems
• Hitting sets when the VC-dimension is small
• Fractional cascading. I: A data structuring technique
• Practical and efficient algorithms for the geometric hitting set problem
• Fast Algorithms for Finding Nearest Common Ancestors
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Reducibility among Combinatorial Problems
• The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
• PTAS for geometric hitting set problems via local search
• Algorithms – ESA 2005
• Algorithms for the line-constrained disk coverage and related problems

This page was built for publication: Geometric hitting set for line-constrained disks