Back to Results
First PageMeta Content
NP-complete problems / Operations research / Independent set / Optimization problem / Discrete geometry / Graph / Duality / Packing problems / Mathematical optimization / Planar graphs / Matching / Matroid


A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry
Add to Reading List

Open Document

File Size: 480,74 KB

Share Result on Facebook