Pages that link to "Item:Q4706196"
From MaRDI portal
The following pages link to The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set (Q4706196):
Displaying 17 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Finding one community in a sparse graph (Q892403) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Dynamic node packing (Q2097666) (← links)
- Isotonic regression with unknown permutations: statistics, computation and adaptation (Q2119231) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- Finding Hidden Cliques in Linear Time with High Probability (Q5414144) (← links)
