A nearly optimal randomized algorithm for explorable heap selection

Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev

Open source

DOI: 10.1007/s10107-024-02145-5
Published: 2024-11-05
Container: Mathematical Programming
Publisher: Springer Science and Business Media LLC
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s10107-024-02145-5,
  title = {A nearly optimal randomized algorithm for explorable heap selection},
  author = {Sander Borst and Daniel Dadush and Sophie Huiberts and Danish Kashaev},
  year = {2024},
  journal = {Mathematical Programming},
  doi = {10.1007/s10107-024-02145-5},
  url = {https://doi.org/10.1007/s10107-024-02145-5}
}

RIS

TY  - JOUR
TI  - A nearly optimal randomized algorithm for explorable heap selection
AU  - Sander Borst
AU  - Daniel Dadush
AU  - Sophie Huiberts
AU  - Danish Kashaev
PY  - 2024
JO  - Mathematical Programming
DO  - 10.1007/s10107-024-02145-5
UR  - https://doi.org/10.1007/s10107-024-02145-5
ER  -

APA

Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2024). A nearly optimal randomized algorithm for explorable heap selection. Mathematical Programming. https://doi.org/10.1007/s10107-024-02145-5

Source records

crossref · retrieved 2026-09-25T15:10:17.589Z