Selected open problems in discrete geometry and optimization
Convex programming (90C25) Linear programming (90C05) Combinatorial optimization (90C27) Semidefinite programming (90C22) (n)-dimensional polytopes (52B11) Convex sets in (2) dimensions (including convex curves) (52A10) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Semi-infinite programming (90C34) Helly-type theorems and geometric transversal theory (52A35) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Combinatorial complexity of geometric structures (52C45) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
- Discrete geometry. Abstracts from the workshop held September 4--10, 2011.
- Discrete geometry. Abstracts from the workshop held September 21st -- September 27th, 2008.
- Discrete geometry. Abstracts from the workshop held August 31 -- September 6, 2014.
- Discrete geometry. Abstracts from the workshop held April 9--15, 2017
- Research Problems in Discrete Geometry
- scientific article; zbMATH DE number 4024168 (Why is no real title available?)
- scientific article; zbMATH DE number 17658 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1542670 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- A counterexample to the Hirsch conjecture
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- A note on the complexity of \(L _{p }\) minimization
- A proof of the Kepler conjecture
- A semidefinite programming approach to tensegrity theory and realizability of graphs
- Algorithmic Aspects of Wireless Sensor Networks
- Classical topics in discrete geometry
- Comparing SOS and SDP relaxations of sensor network localization
- Contact numbers for congruent sphere packings in Euclidean 3-space
- Covering large balls with convex sets in spherical space
- Coverings by convex bodies and inscribed balls
- Das Problem der dreizehn Kugeln
- Deriving finite sphere packings
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Hyperplane Arrangements with Large Average Diameter
- Hyperplane arrangements with large average diameter: a computational approach
- Localization from incomplete noisy distance measurements
- On bar frameworks, stress matrices and semidefinite programming
- On the maximum number of touching pairs in a finite packing of translates of a convex body
- Orthocentric simplices and biregularity
- Realizability of graphs
- Realizability of graphs in three dimensions
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Simplices of Maximal Volume or Minimal Total Edge Length in Hyperbolic Space
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- The Gram dimension of a graph
- The volume of relaxed Boolean-quadric and cut polytopes
- Theory of semidefinite programming for sensor network localization
- Two tree-width-like graph invariants
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
- Preface: Optimization and discrete geometry
- Discrete geometry. Abstracts from the workshop held September 4--10, 2011.
- Discrete geometry. Abstracts from the workshop held September 21st -- September 27th, 2008.
- Connecting Cycles for Concentric Circles
- Some problems, I care most
- Open problems on \(k\)-orbit polytopes
- Open problems from the 2018 Summer Workshop on Lattice Polytopes at Osaka University
- Preface: Special issue on optimization in distance geometry
- scientific article; zbMATH DE number 4009232 (Why is no real title available?)
This page was built for publication: Selected open problems in discrete geometry and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849006)
