@techreport{R-86-25,
TITLE = {Greedy Matching on a Grid},
AUTHOR = {Rolf G. Karlsson},
YEAR = {1986},
NUMBER = {R-86-25},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-86-25+abstr},
ABSTRACT = {A fast solution to the complete minimum matching problem using a greedy heuristic is presented, when the points are distributed on a grid domain. For this a data structure which efficiently supports nearest neighbor searches and deletions is developed.},
IDANR = {LiTH-IDA-R-86-25},
NOTE = {Also in BIT}