Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bruno Escoffier / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174811417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min coloring by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact algorithms for MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time approximation of weighted set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX SAT approximation beyond the limits of polynomial-time approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the structure of approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Time 2-Approximation Algorithm for Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case study of local search for MAX-\(k\)-SAT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 9 July 2024

scientific article
Language Label Description Also known as
English
Approximating MAX SAT by moderately exponential and parameterized algorithms
scientific article

    Statements

    Approximating MAX SAT by moderately exponential and parameterized algorithms (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    maximum satisfiability
    0 references
    exponential time algorithms
    0 references
    approximation algorithms
    0 references
    0 references