Simple approximation algorithms for balanced MAX~2SAT (Q1742374): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s00453-017-0312-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2488011622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Sharp Inapproximability for Any 2-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Recent Approximation Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Cut and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler 3/4-Approximation Algorithms for MAX SAT / rank
 
Normal rank

Latest revision as of 11:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Simple approximation algorithms for balanced MAX~2SAT
scientific article

    Statements

    Simple approximation algorithms for balanced MAX~2SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2018
    0 references
    0 references
    maximum satisfiability
    0 references
    approximation algorithm
    0 references
    greedy algorithm
    0 references
    spectral algorithm
    0 references
    balanced instances
    0 references
    priority algorithm
    0 references
    0 references