Hitting geometric objects online via points in \(\mathbb{Z}^d\)

DOI10.1007/978-3-031-22105-7_48OpenAlexW4313343165MaRDI QIDQ6168978

Satyam Singh, Minati De

Publication date: 10 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-22105-7_48

zbMATH Keywords

geometric objectscompetitive ratioonline algorithmhitting setunit covering

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)

Cites Work

• Unnamed Item
• Hitting sets online and unique-MAX coloring
• Optimal packing and covering in the plane are NP-complete
• Online unit clustering and unit covering in higher dimensions
• A threshold of ln n for approximating set cover
• The Online Set Cover Problem
• Approximation schemes for covering and packing problems in image processing and VLSI
• Incremental Clustering and Dynamic Information Retrieval
• Reducibility among Combinatorial Problems
• Online unit covering in Euclidean space

This page was built for publication: Hitting geometric objects online via points in \(\mathbb{Z}^d\)