Bounds for the Lonely Runner Problem via Linear Programming
Abstract
In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.