3874 search results - page 311 / 775 » Approximation Algorithms for k-hurdle Problems |
137
Voted
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
170
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
121
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
161
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...