Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2003.07.012 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.07.012 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230348051 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230348051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / 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 MAX-3-CUT and other problems via complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Approximation Algorithms Based on Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chebyshev Polynomials of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2003.07.012 / rank
 
Normal rank

Latest revision as of 11:55, 16 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
scientific article

    Statements

    Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (English)
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    Approximation algorithms
    0 references
    Semidefinite programming
    0 references
    Maximum cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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