J. Mark Keil. Approximating the Complete Euclidean Graph. In Rolf G. Karlsson, Andrzej Lingas, editors, SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings. Volume 318 of Lecture Notes in Computer Science, pages 208-213, Springer, 1988.
@inproceedings{Kei88,
title = {Approximating the Complete Euclidean Graph},
author = {J. Mark Keil},
year = {1988},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Kei88},
cites = {0},
citedby = {0},
pages = {208-213},
booktitle = {SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings},
editor = {Rolf G. Karlsson and Andrzej Lingas},
volume = {318},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-19487-8},
}