Selected open problems in discrete geometry and optimization

DOI10.1007/978-3-319-00200-2_18zbMATH Open1273.90114OpenAlexW172577939MaRDI QIDQ2849006FDOQ2849006

Antoine Deza, Károly Bezdek, Yinyu Ye

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_18

Recommendations

• 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

zbMATH Keywords

combinatorial optimizationcontinuous optimizationdiscrete geometryopen problems

Mathematics Subject Classification ID

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)

Cites Work

• A proof of the Kepler conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the complexity of \(L _{p }\) minimization
• Classical topics in discrete geometry
• Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• A counterexample to the Hirsch conjecture
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Das Problem der dreizehn Kugeln
• Title not available (Why is that?)
• Title not available (Why is that?)
• Localization from incomplete noisy distance measurements
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
• Theory of semidefinite programming for sensor network localization
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Orthocentric simplices and biregularity
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Simplices of Maximal Volume or Minimal Total Edge Length in Hyperbolic Space
• On the maximum number of touching pairs in a finite packing of translates of a convex body
• Contact numbers for congruent sphere packings in Euclidean 3-space
• Algorithmic Aspects of Wireless Sensor Networks
• Deriving Finite Sphere Packings
• Two tree-width-like graph invariants
• On bar frameworks, stress matrices and semidefinite programming
• Realizability of graphs
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Universal Rigidity and Edge Sparsification for Sensor Network Localization
• Comparing SOS and SDP relaxations of sensor network localization
• A semidefinite programming approach to tensegrity theory and realizability of graphs
• Coverings by convex bodies and inscribed balls
• Covering large balls with convex sets in spherical space
• Realizability of graphs in three dimensions
• Title not available (Why is that?)
• The volume of relaxed Boolean-quadric and cut polytopes
• The Gram Dimension of a Graph
• Hyperplane arrangements with large average diameter: a computational approach
• Hyperplane Arrangements with Large Average Diameter
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Preface: Special issue on optimization in distance geometry
• Open problems on \(k\)-orbit polytopes
• Connecting Cycles for Concentric Circles
• Open problems from the 2018 Summer Workshop on Lattice Polytopes at Osaka University

Uses Software

• SFSDP
• kepler98

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)