BubbleSearch: A simple heuristic for improving priority-based greedy algorithms

We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority algorithms, which sequentially assign values to elements in some fixed or adaptively determined order. BubbleSearch extends priority algorithms by selectively considering additional orders near an initial good ordering. While many notions of nearness are possible, we explore algorithms based on the Kendall-tau distance (also known as the BubbleSort distance) between permutations. Our contribution is to elucidate the BubbleSearch paradigm and experimentally demonstrate its effectiveness. 2005 Published by Elsevier B.V.

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Neal Lesh, Michael Mitzenmacher
• Keywords: Borodin Et, IPL 2006, Priority Algorithms, Priority-based Greedy Heuristics