Bubblesearch: a simple heuristic for improving priority-based greedy algorithms

DOI10.1016/J.IPL.2005.08.013MaRDI QIDQ1045924zbMATH OpenOpenAlexFDO

Authors Neal Lesh, Michael Mitzenmacher

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.08.013

zbMATH Keywords

randomized algorithmsgreedy algorithmsheuristic algorithmspriority algorithmsGRASP algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2119736
• Approximation and Online Algorithms
• (Incremental) priority algorithms
• Priority algorithms for graph optimization problems
• Improving Greedy Algorithms by Lookahead-Search

Cites work

• scientific article; zbMATH DE number 1947045 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2119736 (Why is no real title available?)
• An improved BL lower bound
• Edge crossings in drawings of bipartite graphs
• Exhaustive approaches to 2D rectangular perfect packings
• Human-guided search
• New heuristic and interactive approaches to 2D rectangular strip packing
• Orthogonal Packings in Two Dimensions
• Semi-greedy heuristics: An empirical study

Cited in

(2)

• Advice complexity of adaptive priority algorithms
• Randomized priority algorithms

Describes a project that uses

Uses Software

• HuGS

This page was built for publication: Bubblesearch: a simple heuristic for improving priority-based greedy algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045924)