Sciweavers

44 search results - page 4 / 9
» Distributed Approximation of Capacitated Dominating Sets
Sort
View
ICDCS
2008
IEEE
13 years 11 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
14 years 6 months ago
Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
Stilian Stoev, Marios Hadjieleftheriou, George Kol...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
13 years 9 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
13 years 11 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 5 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...