Sciweavers

364 search results - page 14 / 73
» Shortest-path network interdiction
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
INFOCOM
2006
IEEE
14 years 1 months ago
Locating Sensors in Concave Areas
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
Chen Wang, Li Xiao
INFOCOM
2003
IEEE
14 years 23 days ago
An approach to alleviate link overload as observed on an IP backbone
Abstract -- Shortest path routing protocols may suffer from congestion due to the use of a single shortest path between a source and a destination. The goal of our work is to first...
Sundar Iyer, Supratik Bhattacharyya, Nina Taft, Ch...
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
EMMCVPR
2007
Springer
13 years 11 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...