Lower-Stretch Spanning Trees
Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng
Abstract
We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)2). Moreover, we show how to construct such a tree in time O(m log2 n).
Create a lesson
Related papers
A Simple Subquadratic Cut Query Protocol for Directed Reachability
Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal
Online Edge-Weighted Matching Beyond 0.55
Alireza Farhadi, Mohammad Hajiaghayi
Nonuniform Buy-at-Bulk Network Design: Improved Approximation and LP Integrality Gap
Iman Gholami, MohammadTaghi Hajiaghayi
Prophet Secretary for Matroids and XOS Valuations: A Strict Separation at 1-1/e
Hossein Esfandiari, MohammadTaghi Hajiaghayi
Deterministic Fault-Tolerant Connectivity Oracles with Subquadratic Space
Merav Parter, Elad Tzalik
The 3-Uniform Hyperclique Hypothesis is False
Timothy M. Chan, Reina Itakura, Zhiyuan Ma et al.