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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 19:34, 5 March 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
    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