Sciweavers

177 search results - page 3 / 36
» Link Distance and Shortest Path Problems in the Plane
Sort
View
RSA
2010
118views more  RSA 2010»
13 years 4 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
13 years 11 months ago
Straightest Paths on Meshes by Cutting Planes
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to c...
Sungyeol Lee, Joonhee Han, Haeyoung Lee
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 10 days ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
COMPGEOM
2005
ACM
13 years 7 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
JALC
2002
97views more  JALC 2002»
13 years 5 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri