7129 search results - page 514 / 1426 » Approximation Algorithms for Treewidth |
163
click to vote
ICALP
2005
Springer
16 years 16 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...
234
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...
269
click to vote
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 ...
166
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
202
Voted
CORR
2010
Springer
15 years 5 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...