Sciweavers

422 search results - page 22 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 9 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
CRV
2005
IEEE
342views Robotics» more  CRV 2005»
13 years 9 months ago
PDE-Based Robust Robotic Navigation
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
M. Sabry Hassouna, Alaa E. Abdel-Hakim, Aly A. Far...
SIAMDM
1998
55views more  SIAMDM 1998»
13 years 7 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
MST
2010
106views more  MST 2010»
13 years 6 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 28 days ago
Clustering Objects on a Spatial Network
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
Man Lung Yiu, Nikos Mamoulis