Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
type: Item
instance of: scholarly article
title: Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
zbMATH Open document ID: 1184.68622
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5650191
zbMATH Keywords: greedy algorithms
zbMATH Keywords: priority algorithms
zbMATH Keywords: randomized algorithms
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: GRASP algorithms
author: Neal Lesh
author: Michael Mitzenmacher
describes a project that uses: HuGS
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.08.013
OpenAlex ID: W2142044446
cites work: Q4411275
cites work: Orthogonal Packings in Two Dimensions
cites work: Q4829011
cites work: An improved BL lower bound
cites work: Edge crossings in drawings of bipartite graphs
cites work: Semi-greedy heuristics: An empirical study
cites work: Human-guided search
cites work: Exhaustive approaches to 2D rectangular perfect packings
cites work: New heuristic and interactive approaches to 2D rectangular strip packing
cites work: Q4452897
DOI: 10.1016/J.IPL.2005.08.013
description: scientific article; zbMATH DE number 5650191