The following pages link to (Q4828990):
Displaying 9 items.
- 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)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- (Q5009505) (← links)
