Sciweavers

28 search results - page 6 / 6
» Lower bounds for the relative greedy algorithm for approxima...
Sort
View
ANOR
2007
80views more  ANOR 2007»
13 years 5 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 7 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
WINE
2005
Springer
109views Economy» more  WINE 2005»
13 years 11 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...