7930 search results - page 662 / 1586 » Greedy in Approximation Algorithms |
189
Voted
DATE
2006
IEEE
16 years 1 months ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
178
Voted
ICALP
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
239
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
279
Voted
CJ
2008
15 years 7 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
174
click to vote
CSE
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n