A nearly optimal randomized algorithm for explorable heap selection

DOI10.1007/978-3-031-32726-1_3arXiv2210.05982OpenAlexW4377199994MaRDI QIDQ6085985

Sophie Huiberts, Daniel Dadush, Unnamed Author, Danish Kashaev

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.05982

zbMATH Keywords

smallest value in a binary heap

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Selection and sorting with limited storage
• A fast LU update for linear programming
• The theory of search games and rendezvous.
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Branching rules revisited
• An optimal algorithm for selection in a min-heap
• On learning and branching: a survey
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• A near optimal algorithm for the extended cow-path problem in the presence of relative errors
• A Computational Study of Search Strategies for Mixed Integer Programming
• Tree exploration with little memory

This page was built for publication: A nearly optimal randomized algorithm for explorable heap selection