Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434): Difference between revisions

From MaRDI portal
Changed an 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/s12190-009-0290-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028514169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / 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: Q3499508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum cut with limited unbalance / 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: Q4537699 / 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of quasi-Newton equations and quasi-Newton methods for optimization / 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: Outward rotations / rank
 
Normal rank

Latest revision as of 00:01, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for MAX RES CUT with limited unbalanced constraints
scientific article

    Statements

    Approximation algorithms for MAX RES CUT with limited unbalanced constraints (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming relaxation
    0 references
    0 references