Optimal, Robust, and Information-Theoretic Graph Reconstruction from Distance Vectors Integer Programming, Approximation Guarantees, and Adaptive Landmark Selection
Year: 2026
Type: preprint
Source: SSRN Electronic Journal
DOI: 10.2139/ssrn.7717741
Author: Rajit Chatterjea
Institution: University of Pennsylvania
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: graph reconstruction, distance vectors, metric dimension, landmark selection, resolving sets, 0-1 integer programming, set cover, harmonic approximation, robust inference, measurement error, Bayesian experimental design, conditional mutual information, submodular functions, submodular optimization, information-theoretic limits
Open Access status: green
OpenAlex ID: W7235470684
