Is the distance geometry problem in NP?

DOI10.1007/978-1-4614-5128-0_5MaRDI QIDQ2841700zbMATH OpenOpenAlexFDO

Authors Nathanael Beeker, Stéphane Gaubert, Christian Glusa, Leo Liberti

Publication date 29 July 2013

Published in Distance Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5128-0_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12)

Recommendations

• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• New methods for the distance geometry problem
• Feasibility check for the distance geometry problem: an application to molecular conformations
• Euclidean distance geometry. An introduction

Cited in

(3)

• A multiplicative weights update algorithm for MINLP
• Distance geometry and data science
• A cycle-based formulation for the distance geometry problem

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Is the distance geometry problem in NP?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841700)