The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut cone. III: On the role of triangle facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of \(\lambda\)-times repeated blocks for \(\text{TS}(v,\lambda)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation Algorithms for the Max Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node and edge relaxations of the max-cut problem / rank
 
Normal rank

Revision as of 13:46, 23 May 2024

scientific article
Language Label Description Also known as
English
The expected relative error of the polyhedral approximation of the max- cut problem
scientific article

    Statements

    The expected relative error of the polyhedral approximation of the max- cut problem (English)
    0 references
    0 references
    0 references
    25 October 1995
    0 references
    linear relaxation
    0 references
    max-cut problem
    0 references
    random graph
    0 references

    Identifiers