Hitting geometric objects online via points in Z^d

DOI10.1007/978-3-031-22105-7_48MaRDI QIDQ6168978zbMATH OpenOpenAlexFDO

Authors Minati De, Satyam Singh

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

competitive ratiogeometric objectshitting setonline algorithmunit covering

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A threshold of ln n for approximating set cover
• Approximation schemes for covering and packing problems in image processing and VLSI
• Hitting sets online and unique-MAX coloring
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Incremental Clustering and Dynamic Information Retrieval
• Online unit clustering and unit covering in higher dimensions
• Optimal packing and covering in the plane are NP-complete
• Reducibility among combinatorial problems
• The online set cover problem

Cited in

(5)

• Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
• Online hitting set of \(d\)-dimensional fat objects
• Online geometric covering and piercing
• New lower bound and algorithm for online geometric hitting set problem
• Online hitting sets for disks of bounded radii

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

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