A Nearly Optimal Randomized Algorithm for Explorable Heap Selection
- 22 May 2023
- book chapter
- Published by Springer Nature
- p. 29-43
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruningDiscrete Optimization, 2016
- Space-efficient parallel algorithms for combinatorial search problemsJournal of Parallel and Distributed Computing, 2015
- Branching rules revisitedOperations Research Letters, 2005
- Tree exploration with little memoryJournal of Algorithms, 2004
- A Computational Study of Search Strategies for Mixed Integer ProgrammingINFORMS Journal on Computing, 1999
- On-line searching and navigation1998
- A near optimal algorithm for the extended cow-path problem in the presence of relative errorsLecture Notes in Computer Science, 1995
- An Optimal Algorithm for Selection in a Min-HeapInformation and Computation, 1993
- A fast LU update for linear programmingAnnals of Operations Research, 1993
- Selection and sorting with limited storageTheoretical Computer Science, 1980