Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q436320 |
Changed an Item |
||
| Property / author | |||
| Property / author: Georg Schnitger / rank | |||
Normal rank | |||
Revision as of 22:00, 14 February 2024
scientific article; zbMATH DE number 6736410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds |
scientific article; zbMATH DE number 6736410 |
Statements
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (English)
0 references
28 June 2017
0 references
approximation algorithms
0 references
greedy algorithms
0 references
maximum satisfiability problem
0 references
priority algorithms
0 references
randomized algorithms
0 references
