Reproduce “Logarithmic Embeddings into Probabilistic Spanning Trees for Distances and Capacities” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Mohammad Hajiaghayi

The authors construct distributions over spanning trees whose vertices and edges come from the input graph. A distance distribution gives every vertex pair expected stretch O(log n), while a separate capacity distribution supports cut approximation and fractional oblivious routing with O(log n) guarantees. For rational inputs, both distributions are computable in polynomial time; the guarantees are expected, not per-tree.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.