Sciweavers

467 search results - page 62 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
ICNP
2007
IEEE
14 years 1 months ago
Geographically Informed Inter-Domain Routing
Abstract— We propose to add geographic location information into BGP routing updates to enable Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geo...
Ricardo V. Oliveira, Mohit Lad, Beichuan Zhang, Li...
BROADNETS
2006
IEEE
14 years 1 months ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac
EMMCVPR
2003
Springer
14 years 19 days ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
ESA
2010
Springer
142views Algorithms» more  ESA 2010»
13 years 8 months ago
The Geodesic Diameter of Polygonal Domains
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
Sang Won Bae, Matias Korman, Yoshio Okamoto
WG
2010
Springer
13 years 5 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang