1594 search results - page 36 / 319 » An Algorithm to Compute Collusion Paths |
119
click to vote
COMGEO
1999
ACM
14 years 11 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
GD
2006
Springer
15 years 3 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
101
click to vote
ISVC
2009
Springer
15 years 6 months ago
2009
Springer
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...