7006 search results - page 140 / 1402 » Approximation Algorithms |
104
Voted
IPL
2000
15 years 2 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
145
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
171
Voted
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
75
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
107
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...