Papers › Online Maximum Independent Set of Hyperrectangles
Online Maximum Independent Set of Hyperrectangles
Rishi Advani, Abolfazl Asudeh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned hyperrectangles and the input is provided in an online fashion. We prove results for several adversary models, classes of hyperrectangles, and restrictions on the order of the input. Under the adaptive offline and adaptive online adversary models, we find the optimal online algorithm for unit hypercubes, σ-bounded hypercubes, unit-volume hyperrectangles, and arbitrary hypercubes, in both non-dominated and arbitrary order. Under the oblivious adversary model, we prove bounds on the competitive ratio of an optimal online algorithm for the same classes of hyperrectangles and input orders, and we find algorithms that are optimal up to constant factors. For input in dominating order, we find the optimal online algorithm for arbitrary hyperrectangles under all adversary models. We conclude by discussing several promising directions for future work.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections