OpenAlex
PricingAboutJobs
Log inGet started
Work

Optimal, Robust, and Information-Theoretic Graph Reconstruction from Distance Vectors Integer Programming, Approximation Guarantees, and Adaptive Landmark Selection

HTML

Year: 2026
Type: preprint
Source: SSRN Electronic Journal
DOI: 10.2139/ssrn.7717741
Author: Rajit Chatterjea
Institution: University of Pennsylvania
Language: English

Topic: Graph Labeling and Dimension Problems
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
Cites:
Cited by:
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security