Leo Liberti, James Ostrowski
Journal of Global Optimization
Let n vertices be distributed on the circumference of a circle in the plane. We find, for every n, the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle. The problem arises from the design of a train shuttle service between n cities with continuous guaranteed service at all times, and minimum number of rail lanes. © 1993.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems