Improved approximations for max set splitting and max NAE SAT (Q1878408): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / 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.dam.2002.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008289509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / 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: Q2753735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved rounding method and semidefinite programming relaxation for graph partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of maximum splitting of k-sets and some other Apx-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:19, 6 June 2024

scientific article
Language Label Description Also known as
English
Improved approximations for max set splitting and max NAE SAT
scientific article

    Statements

    Improved approximations for max set splitting and max NAE SAT (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    Max-Set-Splitting
    0 references
    Max NAE SAT
    0 references
    Approximation algorithm
    0 references
    Semidefinite programming relaxation
    0 references

    Identifiers