Companion repo for "Online Maximum Independent Set of Hyperrectangles" paper.
fixed_n_comp_ratio.ipynb includes code to compute upper bounds on the competitive ratio of the "greedy with probability experiments.ipynb includes code to empirically evaluate the online greedy algorithm under different input distributions.
- Clone the repo
- Create a virtual environment using e.g., venv or Conda
- Install any missing packages using e.g., pip or Conda
- only essential external packages are NumPy, SciPy, and Matplotlib
- Run desired notebook using Jupyter Notebook or JupyterLab
This project is licensed under the MIT License — see the LICENSE file for details.
