Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: k-Means Has Polynomial Smoothed Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical properties of winners and losers in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Stable Outcomes in Hedonic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search: Simple, Successful, But Sometimes Sluggish / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Nodes of Degree Four in the Local Max-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Linear Programs and Local Search for Max-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank

Latest revision as of 06:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Settling the Complexity of Local Max-Cut (Almost) Completely
scientific article

    Statements

    Settling the Complexity of Local Max-Cut (Almost) Completely (English)
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    Max-Cut
    0 references
    PLS
    0 references
    graphs
    0 references
    local search
    0 references
    smoothed complexity
    0 references
    0 references