6 search results - page 1 / 2 » Highway Dimension, Shortest Paths, and Provably Efficient Al... |
SODA
2010
ACM
13 years 4 months ago
2010
ACM
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
CIC
2004
13 years 6 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
COMPGEOM
2008
ACM
13 years 7 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...