Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177)

From MaRDI portal
Revision as of 03:18, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
scientific article

    Statements

    Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (English)
    0 references
    27 May 2004
    0 references
    max \(\frac{n}2\)-directed-bisection
    0 references
    max \(\frac{n}2\)-dense-subgraph
    0 references
    Polynomial-time approximation algorithm
    0 references
    Semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers