A nearly optimal randomized algorithm for explorable heap selection.

Borst S, Dadush D, Huiberts S, Kashaev D

DOI: 10.1007/s10107-024-02145-5
Published: 2025
Container: Mathematical programming
Publisher: Not recorded
Open access: yes

Credibility signals

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

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. 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
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
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
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. 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 = {Borst S and Dadush D and Huiberts S and Kashaev D},
  year = {2025},
  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  - Borst S
AU  - Dadush D
AU  - Huiberts S
AU  - Kashaev D
PY  - 2025
JO  - Mathematical programming
DO  - 10.1007/s10107-024-02145-5
UR  - https://doi.org/10.1007/s10107-024-02145-5
ER  -

APA

S, B., D, D., S, H., & D, K. (2025). A nearly optimal randomized algorithm for explorable heap selection.. Mathematical programming. https://doi.org/10.1007/s10107-024-02145-5

Source records

pubmed · retrieved 2026-11-10T10:55:51.594Z