Geometric Shortest Paths and Network Optimization

Geometric Shortest Paths and Network Optimization (1998)

by Joseph S.B. Mitchell

Venue:	Handbook of Computational Geometry
Citations:	126 - 12 self

Datum	Value	Source
TITLE	Geometric Shortest Paths and Network Optimization	SVM HeaderParse 0.1
AUTHOR NAME	Joseph S. B. Mitchell	SVM HeaderParse 0.1
ABSTRACT	A natural and well-studied problem in algorithmic graph theory and network optimization is that of computing a "shortest path " between two nodes, s and t, in a graph whose edges have "weights " associated with them, and we consider the "length " of a path to be the sum of the weights of the edges that comprise it.	SVM HeaderParse 0.1
CITATIONS	103 found	ParsCit 1.0