Searching for "On the Greedy Algorithm for Satisfiability." – sorted by Relevance.
-
On the Greedy Algorithm for Satisfiability
- ON THE GREEDY ALGORITHM FOR SATISFIABILITY Elias Koutsoupias and Christos H. Papadimitriou
- Cited by 26 (0 self) – Add To MetaCart
-
On the Stupid Algorithm for Satisfiability
- the greedy algorithm for satisfiability" In [1], Koutsoupias and Papadimitriou study the greedy algorithm
- Cited by 4 (2 self) – Add To MetaCart
-
Finding Hard Satisfiability Problems Using Bacterial Conjugation
- -climbing algorithm for establishing satisfiability. Studies of the greedy algorithm, for example [Gu 1992] show
- Cited by 10 (0 self) – Add To MetaCart
-
Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover
- algorithm satisfies c greedy c min 2c min \Gamma 1 2c min (ln u \Gamma ln c min ) + 1: The bound
- Cited by 5 (1 self) – Add To MetaCart
-
A Tight Analysis of the Greedy Algorithm for Set Cover
- algorithm outputs a cover of size c greedy satisfying c greedy c min ln m \Gamma ln ln m+ 3 + ln ln 32
- Cited by 49 (0 self) – Add To MetaCart
-
Conjugation - A Bacterially Inspired Form of Genetic Recombination
- to be satisfiable. The greedy algorithm for satisfiability starts with a random assignment of truth values
- Cited by 8 (0 self) – Add To MetaCart
-
Convex matroid optimization
- . The problem is to find a basis of maximum weight, and is quickly solvable by the greedy algorithm. Example 1
- Cited by 4 (4 self) – Add To MetaCart
-
Direct Routing
- i + |p i |}. Proof: We show that the injection times assigned by the greedy algorithm satisfy
- Cited by 3 (3 self) – Add To MetaCart
-
An algorithm for modular exponentiation
- propose the following greedy algorithm with the input as a positive integer x; and an output of 2-integers
- Cited by 11 (3 self) – Add To MetaCart
-
The PCP theorem and hardness of
- and assign x i = 1 if w i 0, and x i = 0 if w(i) ! 0. Proposition 2 The above greedy algorithm satisfies
- Add To MetaCart

