Online Class Cover Problem

In this paper, we study the online class cover problem where a (finite or infinite) family \(\cal F\) of geometric objects and a set \({\cal P}_r\) of red points in \(\mathbb{R}^d\) are given a prior, and blue points from \(\mathbb{R}^d\) arrives one after another. Upon the arrival of a blue point,...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	De, Minati, Maheshwari, Anil, Mandal, Ratnadip
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 03.07.2024
Subjects:	Algorithms Rectangles
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!