Addendum to Etude on theme of Dijkstra

Authors:
S. O. Shilova;N. V. Shilov
Affiliations:
Institute of Mathematics, Novosibirsk, Russia;Institute of Informatics Systems, Novosibirsk, Russia
Venue:
ACM SIGACT News
Year:
2004

Citing 4
Cited 0

Applications of a semi-dynamic convex hull algorithm

SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Applications of a semi-dynamic convex hull algorithm

BIT
Introduction to Algorithms

Introduction to Algorithms
Etude on theme of Dijkstra

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

After publication of our paper Etude on theme of Dijkstra in September issue of v.35 of SIGACT News [1], we had a very interesting communication with Dr. John Hershberger related to the topic of the paper. Etude was not a research paper, but presented a tutorial for undergraduate students who are engaged with programming contests (like ACM ICPC). The tutorial was a part of a special undergraduate course at Novosibirsk State University (Russia) and was based on E. Dijkstra's heuristic search solution of non-crossing matching problem on the plane.