206 search results - page 27 / 42 » Constant factor approximation algorithm for the knapsack med... |
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...