arXiv (All)
open access
When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance
Finding an optimal meeting point for a collection of agents on a directed graph is a classical problem studied in the context of network analysis, operations research and computational geometry. In this work, we use the two objectives of optimal meeting points examined in the literature to study two
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
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies#10306
- Mechanism Design for Facility Location Games Under a Prelocated Facility#799506
- Mechanism Design for Facility Location Games Under a Prelocated Facility#798083
Record · ID 1037252
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