Nordic Journal of Computing Bibliography
Joachim
Gudmundsson, Christos
Levcopoulos, and Giri
Narasimhan. Approximating a Minimum Manhattan Network. Nordic
Journal of Computing, 8(2):216, Summer 2001.
Selected references
- Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, and Michiel
Smid. Euclidean
spanners: Short, thin, and lanky. In Proceedings of the
Twenty-Seventh Annual ACM Symposium on the Theory of Computing,
pages 489-498, Las Vegas, Nevada, 29 May-1 June 1995.
- Christos Levcopoulos and Drago Krznaric. A
fast heuristic for approximating the minimum weight triangulation
(extended abstract). In Rolf G. Karlsson and Andrzej Lingas,
editors, SWAT '96, 5th Scandinavian Workshop on Algorithm
Theory, volume 1097 of Lecture Notes in Computer
Science, pages 296-308, Reykjavík, Iceland, 3-5 July 1996.
Springer.
- Christos Levcopoulos and Drago Krznaric. A
fast heuristic for approximating the minimum weight triangulation
(extended abstract). In Rolf G. Karlsson and Andrzej Lingas,
editors, SWAT '96, 5th Scandinavian Workshop on Algorithm
Theory, volume 1097 of Lecture Notes in Computer
Science, pages 296-308, Reykjavík, Iceland, 3-5 July 1996.
Springer.
Shortcuts: