Pages that link to "Item:Q1380939"
From MaRDI portal
The following pages link to Approximating the independence number via the \(\vartheta\)-function (Q1380939):
Displayed 11 items.
- On a restricted cross-intersection problem (Q855846) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)