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

@article{Lesh2006BubbleSearchAS,
  title={BubbleSearch: A simple heuristic for improving priority-based greedy algorithms},
  author={Neal Lesh and Michael Mitzenmacher},
  journal={Inf. Process. Lett.},
  year={2006},
  volume={97},
  pages={161-169}
}
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the frame cently developed by Borodin et al., we consider priority algorithms, which sequentially assign values to elements in some fixe adaptively determined order. BubbleSearch extends priority algorithms by selectively considering additional orders near good ordering. While many notions of nearness are possible, we explore algorithms based on the Kendall-tau distance (a as the BubbleSort… CONTINUE READING
15 Citations
15 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Two-dimensional packing utilising evolutionary gorithms and other meta-heuristic methods

  • E. Hopper
  • PhD Thesis, Ca University, UK
  • 2000
Highly Influential
4 Excerpts

Integer linear programming approaches to hierar cal graph drawing

  • A. Kuusik
  • Ph.D. Dissertation, Department of Comp Science…
  • 2000

Solving the job shop schedu problem using tabu search

  • J. W. Barnes, J. B. Chambers
  • IIE Trans. 27
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…