Sciweavers

467 search results - page 63 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
STACS
2005
Springer
14 years 26 days ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer
COMGEO
2007
ACM
13 years 7 months ago
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 8 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
IJRR
2006
89views more  IJRR 2006»
13 years 7 months ago
Time-optimal Trajectories for an Omni-directional Vehicle
A common mobile robot design consists of three `omniwheels' arranged at the vertices of an equilateral triangle, with wheel axles aligned with the rays from the center of the...
Devin J. Balkcom, Paritosh A. Kavathekar, Matthew ...
CCCG
2010
13 years 5 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick