David Eppstein

TL;DR: In this article, the Weighted Maximum-Mean Subtree Problem (WMSP) was introduced, where the objective function is a bivariate function f(Σx i, Σy i ) of the sums of these two values.

TL;DR: In this article, the authors describe an algorithm that takes as input n points in the plane and a parameter, and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 + )-approximation to the geometric distances between the points.

TL;DR: This work shows how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(nm) bound.

TL;DR: New applications of the nearest-neighbor chain algorithm are shown, a technique that originated in agglomerative hierarchical clustering that is used to construct the greedy multi-fragment tour for Euclidean TSP and for Steiner TSP in planar graphs in O(n √ n log n) time.

TL;DR: In this paper, the authors studied the problem of low-stretch spanning trees in graphs of bounded width: bandwidth, cutwidth, and treewidth, and showed that any simple connected graph with a linear arrangement of bandwidth $b$ can be embedded into a distribution of spanning trees such that the expected stretch of each edge of $G$ is $O(b^2).