An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bao-Gang Xu / rank
Normal rank
 
Property / author
 
Property / author: Bao-Gang Xu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / 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/s11425-014-4900-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001501791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-oblivious local search for graph and hypergraph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / 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: Problems and results on judicious partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximating Max-Bisection on regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation of Max-Cut on graphs of bounded degree / 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: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / 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: Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability / 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: Inapproximability results for set splitting and satisfiability problems with no mixed clauses / 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: Q2721982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite complex quadratic maximization problems / 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: Approximability of maximum splitting of k-sets and some other Apx-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New semidefinite programming relaxations for box constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced judicious bipartitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on balanced bipartitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On judicious bisections of graphs / 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: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank

Latest revision as of 22:16, 9 July 2024

scientific article
Language Label Description Also known as
English
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
scientific article

    Statements

    An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2015
    0 references
    max hypergraph cut
    0 references
    limited unbalance
    0 references
    randomized approximation algorithm
    0 references
    performance ratio
    0 references
    semidefinite programming
    0 references
    relaxation
    0 references
    combinatorial optimization
    0 references
    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