Sciweavers

228 search results - page 14 / 46
» Online Routing in Triangulations
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 10 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
ICNP
2002
IEEE
14 years 1 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
IPPS
1998
IEEE
14 years 1 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 9 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
CHI
2010
ACM
14 years 3 months ago
Biketastic: sensing and mapping for better biking
Bicycling is an affordable, environmentally friendly alternative transportation mode to motorized travel. A common task performed by bikers is to find good routes in an area, whe...
Sasank Reddy, Katie Shilton, Gleb Denisov, Christi...