The following pages link to (Q188995):
Displaying 11 items.
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- Lifting Markov chains to speed up mixing (Q2819554) (← links)
- Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419) (← links)
- On the Shannon capacity of a graph (Q4178914) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- Hit-and-Run from a Corner (Q5470722) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
