arXiv (All)
open access
Optimal Non-Adaptive Vantage Point Selection
We study the \emph{vantage point selection} problem, introduced by Ashvinkumar, Chowdhury, Gao, Goswami, Mitchell, and Polishchuk [WADS'25] to model the problem of estimating bottleneck capacities on the Internet. The input is a weighted undirected graph with unique shortest paths where every edge h
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distinguishing adjacent vertices by ordering edges#999514
- Efficient Linear Bandits via Cluster-Aware Sketching#1064138
- GateDrain: Availability Attacks and Admission-Side Defense for Confidence-Gated Edge-Cloud Inference#1119065
- Noise-Robust Distributed Optimization Over Directed Graphs With Row Stochastic Matrices#1077410
- Batched Feedback and the Random-Access Wall in Search-Based Graph Construction#1108876
Record · ID 997165
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive