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

DOI10.1016/j.ipl.2005.08.013zbMath1184.68622OpenAlexW2142044446MaRDI QIDQ1045924

Michael Mitzenmacher, Neal Lesh

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

heuristic algorithmsrandomized algorithmsgreedy algorithmspriority algorithmsGRASP algorithms

Mathematics Subject Classification ID

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

Related Items (3)

Advice complexity of adaptive priority algorithms ⋮ Randomized priority algorithms ⋮ Advice complexity of priority algorithms

Uses Software

• HuGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Human-guided search
• An improved BL lower bound
• Edge crossings in drawings of bipartite graphs
• Semi-greedy heuristics: An empirical study
• Exhaustive approaches to 2D rectangular perfect packings
• Orthogonal Packings in Two Dimensions
• New heuristic and interactive approaches to 2D rectangular strip packing

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