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

From MaRDI portal
Revision as of 20:34, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references