arXiv (All)
open access
On the Metric Distortion of the Minimum Spanning Tree Problem
We study the metric distortion of the minimum spanning tree (MST) problem when numerical edge weights are unavailable and each vertex reports only a ranking of the other vertices induced by these weights. We first show, through a simple example, that without assumptions on the weights, no ordinal al
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
- Minimum spanning tree vs Shortest path#796567
- Multilevel Dynamic Thinning for Matroid Secretary#1201280
- A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane#986603
- Subtree Counts and the Maximum Mean Subtree Order#1083800
- An Algorithm for Linear Parametric Minimum Cycle Mean Problem#1077163
Record · ID 1387321
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