An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4251055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for max<i>k</i>-uncut with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The RPR2 rounding technique for semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Half Approximation Algorithms for the k-Partition Problem / 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: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / 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: Segmentation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH / 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: Complex Quadratic Optimization and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank

Revision as of 23:59, 12 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
scientific article

    Statements

    An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (English)
    0 references
    29 November 2016
    0 references
    complex semidefinite programming
    0 references
    approximation algorithm
    0 references
    balanced Max-3-Uncut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers