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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Petros Drineas / rank
 
Normal rank
Property / author
 
Property / author: Ravindran Kannan / 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.1002/rsa.20196 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3083201583 / rank
 
Normal rank
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

Latest revision as of 11: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
    0 references
    5 June 2008
    0 references
    0 references
    Max-Cut algorithm
    0 references
    CUR matrix decomposition
    0 references
    Sampling Linear Programs
    0 references
    0 references