467 search results - page 65 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
SIAMCOMP
2008
13 years 7 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
ALGORITHMICA
2005
13 years 7 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...