Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling lower bounds via information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank

Revision as of 10:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
scientific article

    Statements

    Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    Max-Cut algorithm
    0 references
    CUR matrix decomposition
    0 references
    Sampling Linear Programs
    0 references

    Identifiers