(home)   //   (publications)   //   (blog)   //   (scans from the library)

A nearly optimal randomized algorithm for explorable heap selection

PDF

arXiv

BibTeX

@article{BDHK22,
  title = {A nearly optimal randomized algorithm for explorable heap selection},
  volume = {210},
  DOI = {10.1007/s10107-024-02145-5},
  number = {1–2},
  archivePrefix={arXiv},
  eprint={2210.05982},
  journal = {Mathematical Programming},
  publisher = {Springer Science and Business Media LLC},
  author = {Borst,  Sander and Dadush,  Daniel and Huiberts,  Sophie and Kashaev,  Danish},
  year = {2024},
  month = nov,
  pages = {75–96},
  note={preliminary version in IPCO 2023}
}
A nearly optimal randomized algorithm for explorable heap selection (Oct 2022)
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev.
IPCO 2023, Mathematical Programming / arXiv / talk / bibTeX
On the Integrality Gap of Binary Integer Programs with Gaussian Data (Dec 2020)
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari.
IPCO 2021, Mathematical Programming / arXiv / bibTeX