Improved Deterministic Algorithm for Approximate Minimum Spanning Trees in Doubling Metrics
The minimum spanning tree (MST) problem is one of the most basic optimization problems on metric spaces and graphs. We study the problem of computing a $(1+ε)$-approximation to the MST of an…
Read the full articleYou might also wanna read
New Algorithm Breaks Dijkstra's Time Complexity for Directed Shortest Paths
We give a deterministic $O(m\log^{2/3}n)$-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative e
arxiv.org·11mo ago
Understanding Wilson's Algorithm for Uniform Spanning Trees
Article URL: Comments URL: Points: 8 # Comments: 0
cruzgodar.com·9mo ago
B-Trees, LSM Trees, and the Indexing Tradeoff Spectrum
> **Cross-posted.** This article's canonical home is [Iceberg Lakehouse](
datalakehousehub.com·2mo ago
CompactLog – Solving CT Scalability with LSM-Trees
Article URL: Comments URL: Points: 5 # Comments: 0
github.com·1y ago
Modern Minimal Perfect Hashing: A Survey
Article URL: Comments URL: Points: 3 # Comments: 0
arxiv.org·1y ago
ACM Transactions on Algorithms (talg) Vol 22, Issue 3
cacm.acm.org
Comments
Sign in to join the conversation.
No comments yet. Be the first.