An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-013-9673-1 / rank
Normal rank
 
Property / author
 
Property / author: Chen-Chen Wu / rank
Normal rank
 
Property / author
 
Property / author: Dong-lei Du / rank
Normal rank
 
Property / author
 
Property / author: Da-Chuan Xu / rank
Normal rank
 
Property / author
 
Property / author: Chen-Chen Wu / rank
 
Normal rank
Property / author
 
Property / author: Dong-lei Du / rank
 
Normal rank
Property / author
 
Property / author: Da-Chuan Xu / 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.1007/s10878-013-9673-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086871104 / 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: Q5743407 / 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: 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: 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: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / 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: Better approximation algorithms for influence maximization in online social networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-013-9673-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:10, 18 December 2024

scientific article
Language Label Description Also known as
English
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
scientific article

    Statements

    An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (English)
    0 references
    10 July 2015
    0 references
    semidefinite programming hierarchies
    0 references
    approximation algorithm
    0 references
    rounding
    0 references
    graph bisection problems
    0 references
    0 references
    0 references
    0 references

    Identifiers