arXiv (All)
open access
Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm
Given an undirected weighted graph $G$, a $γ$-approximate low-stretch spanning tree (LSST) $T \subseteq G$ is a tree that approximates the distance metric of $G$ up to a $γ$-factor in expectation. Currently, existing algorithms to find a provably good LSST carefully construct an approximate shortest
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
- A Sharper Explicit Bound on the Subtour-LP Integrality Gap for Metric TSP#1128863
- Exponential Lower Bounds for Integer-Weighted Shortest-Paths Preservers of DAGs#1000175
- Sparsification Framework for Directed Densest Subgraph#1155781
- A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem#464640
- On the Instance Optimality of Bidirectional Dijkstra's Algorithm#820644
Record · ID 1129736
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