Online class cover problem
From MaRDI portal
Publication:6600810
DOI10.1016/j.comgeo.2024.102120MaRDI QIDQ6600810
Anil Maheshwari, Ratnadip Mandal, Minati De
Publication date: 10 September 2024
Published in: Computational Geometry (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The class cover problem with boxes
- Hitting sets online and unique-MAX coloring
- A randomized algorithm for online unit clustering
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
- Randomized nonlinear projections uncover high-dimensional structure
- Approximation algorithms for the class cover problem
- Online unit clustering and unit covering in higher dimensions
- The Online Set Cover Problem
- Surface Approximation and Geometric Partitions
- Incremental Clustering and Dynamic Information Retrieval
- Approximation Schemes for Covering and Packing
- Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
- Online Conflict‐Free Coloring for Intervals
- Online unit covering in Euclidean space
- Inapproximability of finding maximum hidden sets on polygons and terrains
- An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
- Online and dynamic algorithms for geometric set cover and hitting set
This page was built for publication: Online class cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6600810)
