The following pages link to (Q3002764):
Displaying 24 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← 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)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- (Q4568111) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- (Q5743407) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5919792) (← links)
