Sciweavers

710 search results - page 57 / 142
» On Minimum Power Connectivity Problems
Sort
View
RTAS
2008
IEEE
16 years 12 days ago
Real-Time Dynamic Power Management through Device Forbidden Regions
Dynamic Power Management (DPM) techniques are crucial in minimizing the overall energy consumption in real-time embedded systems. The timing constraints of real-time applications ...
Vinay Devadas, Hakan Aydin
INFOCOM
2005
IEEE
15 years 11 months ago
Energy optimal control for time varying wireless networks
Abstract— We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates with...
Michael J. Neely
WADS
2005
Springer
145views Algorithms» more  WADS 2005»
15 years 11 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è...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 7 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
ICALP
2005
Springer
15 years 11 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....