Pages that link to "Item:Q4388988"
From MaRDI portal
The following pages link to The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover (Q4388988):
Displaying 14 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
- Specified intersections (Q2862137) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
