Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056590617 / rank
 
Normal rank

Latest revision as of 23:22, 19 March 2024

scientific article
Language Label Description Also known as
English
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
scientific article

    Statements

    Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2011
    0 references
    maximum acyclic subgraph
    0 references
    feedback arc set
    0 references
    unique games conjecture
    0 references
    hardness of approximation
    0 references
    integrality gaps
    0 references

    Identifiers