Sciweavers

WADS
2005
Springer
145views Algorithms» more  WADS 2005»
13 years 10 months ago
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
Victor Chepoi, Bertrand Estellon, Yann Vaxè...
WADS
2005
Springer
57views Algorithms» more  WADS 2005»
13 years 10 months ago
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu