Sciweavers

113 search results - page 6 / 23
» On the expected value of the minimum assignment
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
GLOBECOM
2010
IEEE
14 years 7 months ago
Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks
Duty cycling is often used to reduce the energy consumption caused by idle listening in Wireless Sensor Networks (WSNs). Most studies on WSN protocols define a common duty cycle va...
Yuqun Zhang, Chen-Hsiang Feng, Ilker Demirkol, Wen...
SOFSEM
2007
Springer
15 years 3 months ago
A Simple Algorithm for Stable Minimum Storage Merging
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
Pok-Son Kim, Arne Kutzner
ICALP
2009
Springer
15 years 10 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
14 years 9 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson