509 search results - page 70 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
126
Voted
IPCO
1998
15 years 5 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
170
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
141
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
144
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
153
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...