Minimum Dilation Stars
Abstract
The dilation of a Euclidean graph is defined as the ratio of distance in the graph divided by distance in Rd. In this paper we consider the problem of positioning the root of a star such that the dilation of the resulting star is minimal. We present a deterministic O(n log n)-time algorithm for evaluating the dilation of a given star; a randomized O(n log n) expected-time algorithm for finding an optimal center in Rd; and for the case d=2, a randomized O(n 2(alpha(n)) log2 n) expected-time algorithm for finding an optimal center among the input points.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.