𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the greedy algorithm for satisfiability

✍ Scribed by Elias Koutsoupias; Christos H. Papadimitriou

Book ID
107766011
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
224 KB
Volume
43
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Greedy Algorithms for On-Line Data Compr
Greedy Algorithms for On-Line Data Compression
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Ulrich Pferschy; Gerhard J Woeginger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 191 KB

We consider on-line text-compression problems where compression is done by Ε½ . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i

Tight Bound on Johnson's Algorithm for M
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
✍ Jianer Chen; Donald K. Friesen; Hao Zheng πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 223 KB

We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1Γ‚2, we show that the performance ratio is 2Γ‚3 and that this bound is