7930 search results - page 282 / 1586 » Greedy in Approximation Algorithms |
181
click to vote
IJCAI
1997
15 years 8 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
190
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
159
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
128
click to vote
TCS
2002
15 years 6 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
163
click to vote
WEA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...