Searching for "Completeness in Approximation Classes" – sorted by Relevance.
-
Structure in Approximation Classes
- for as many approximation classes as possible, we give the first examples of natural NPO-complete problems
- Cited by 67 (13 self) – Add To MetaCart
-
Structure in Approximation Classes (Extended Abstract)
- reducibilities By means of these reducibilities, several notions of completeness in approximation classes have
- Add To MetaCart
-
Constraint Satisfaction: The Approximability of Minimization Problems
- ). Completeness in approximation classes can be defined using appropriate approximation preserving reducibilities
- Cited by 42 (6 self) – Add To MetaCart
-
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean
- A Complete Classication of the Approximability of Maximization Problems Derived from Boolean
- Cited by 35 (6 self) – Add To MetaCart
-
Two Aspects of Optimization Problems over the Real Numbers
- becomes hard. 9 2 General Definitions 10 3 Completeness in Approximation Classes One tradition
- Add To MetaCart
-
The Approximability of Constraint Satisfaction Problems
- . approximation algorithms, approximation classes, approximation-preserving reductions, complete problems, Boolean
- Cited by 34 (1 self) – Add To MetaCart
-
Constraint Satisfaction: The Approximability of Minimization Problems
- . logarithmic/polynomial factor in the size of the input). Completeness in approximation classes can be defined
- Add To MetaCart
-
A compendium of NP optimization problems
- if P 6= NP. 3. Completeness in Approximation Classes In this section we define a natural approximation
- Cited by 54 (1 self) – Add To MetaCart
-
unknown title
- completeness for approximation classes in terms of reducibility, rather than the hardness of approximation
- Add To MetaCart
-
unknown title
- of the input). Completeness in approximation classes can be de-fined using appropriate approximation
- Add To MetaCart

