Lower Bounds, Graph Embeddings, Combinatorial Preconditioners, Gary L. Miller, Peter C. Richter
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and dilation of an...