Searching for "Approximation Algorithms for the Maximum Satisfiability Problem." – sorted by Relevance.
-
NEW-aa-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM*
- and Applied Mathematics 013 NEW -aa-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM* MICHEL X
- Add To MetaCart
-
New 3/4-Approximation Algorithms for MAX SAT
- for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes non-trivial use of solutions to maximum flow
- Cited by 18 (5 self) – Add To MetaCart
-
David P. Williamson
- the first 3 4 -approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm
- Add To MetaCart
-
The Primal-Dual Method for Approximation Algorithms
- -approximation algorithm for the maximum satisfiability problem, an (ln n + 1)-approximation algorithm
- Cited by 101 (7 self) – Add To MetaCart
-
A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms
- approximation algorithms for the Maximum Satisfiability problem [GW94] and the Constraint Satisfaction problem
- Cited by 3 (0 self) – Add To MetaCart
-
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric
- time algorithms that compute approximate solutions to various geometric optimization problems
- Add To MetaCart
-
A Greedy Strategy for Finding Motifs from Yes-No Examples
- algorithms for the maximum satisfiability problem [11, 23]. For motifs of a special type, Tateishi et al. [20
- Add To MetaCart

