Sciweavers

3875 search results - page 63 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ALGOSENSORS
2009
Springer
14 years 3 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
STACS
2001
Springer
14 years 1 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
ICAC
2006
IEEE
14 years 2 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
ISAAC
2009
Springer
103views Algorithms» more  ISAAC 2009»
14 years 3 months ago
An Improved Approximation Algorithm for the Traveling Tournament Problem
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashir...