Conceptio › Archive › arXiv (All)
arXiv (All)open access

When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance

Kirkpatrick, Yael et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
05c85data-structures-and-algorithms
data structures and algorithms, 05c85, f.2
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1037252
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.