A linear program for points of interest relocation in adaptive maps

DOI10.1007/978-3-031-38299-4_57OpenAlexW4385435055MaRDI QIDQ6179055

Antonio Mucherino, Simon B. Hengeveld, Frank Plastria, David A. Pelta

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38299-4_57

zbMATH Keywords

distance geometry problemPOI relocation problem

Mathematics Subject Classification ID

Linear programming (90C05) Metric geometry (51F99) Combinatorial aspects of finite geometries (05B25) General theory of distance geometry (51K05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• An alternative approach to distance geometry using \(L^\infty\) distances
• New error measures and methods for realizing protein graphs from distance data
• Distance geometry in linearizable norms
• Distance Geometry
• Euclidean Distance Geometry and Applications

This page was built for publication: A linear program for points of interest relocation in adaptive maps