Average case polyhedral complexity of the maximum stable set problem (Q344955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common information and unique disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching polytope does not admit fully-polynomial size relaxation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Limits of Linear Programs (Beyond Hierarchies) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Combinatorial Problems via Small LPs and SDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information complexity approach to extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that the extension complexity of the correlation polytope grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Revision as of 23:35, 12 July 2024

scientific article
Language Label Description Also known as
English
Average case polyhedral complexity of the maximum stable set problem
scientific article

    Statements

    Average case polyhedral complexity of the maximum stable set problem (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    linear programs
    0 references
    0 references

    Identifiers