3874 search results - page 395 / 775 » Approximation Algorithms for k-hurdle Problems |
175
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
238
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
199
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
186
click to vote
ESA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
155
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...