Greedy matching on a grid

DOI10.1007/BF01934691zbMath0709.68514OpenAlexW2055541487MaRDI QIDQ921922

Rolf G. Karlsson

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934691

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds for sorting integers on random access machines
• A survey of heuristics for the weighted matching problem
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
• Decomposable searching problems I. Static-to-dynamic transformation
• On a Greedy Heuristic for Complete Matching

This page was built for publication: Greedy matching on a grid