Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds

From MaRDI portal

(Redirected from Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Greedy_Algorithms_for_the_Maximum_Satisfiability_Problem:_Simple_Algorithms_and_Inapproximability_Bounds&oldid=94613291"