Pages that link to "Item:Q5219712"
From MaRDI portal
The following pages link to No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712):
Displaying 13 items.
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Set-weighted games and their application to the cover problem (Q2083971) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Integrality gap of the vertex cover linear programming relaxation (Q2294318) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- The k-Observer Problem on d-regular Graphs (Q5207902) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
