University of Waterloo / Simon Fraser University / /
IndustryTerm
storage applications / polynomial time algorithms / path algorithms / room search / polynomial time algorithm / valid search schedule / search problem / search schedule / search schedules / room search problem / room search schedule / search space / quickest search schedule / /
Organization
David R. Cheriton School of Computer Science / University of Waterloo / Simon Fraser University / /
Person
Anna Lubiw / Tsunehiko Kameda / David P. Dobkin / Kevin S. Klenk / Joseph S. B. Mitchell / Kyung-Yong Chwa / Jean-Claude Latombe / Hung-Yi T. Tu / Rolf Klein / Sang-Min Park / John Z. Zhang / Alon Efrat / Leonidas J. Guibas / Binay Bhattacharya / Borislav H. Simov / Giora Slutzki / Rajeev Motwani / Qiaosheng Shi / David C. Lin / E. A. Melissaratos / Ichiro Suzuki / T. M. Murali / Steven M. LaValle / Danny Z. Chen / Christian Icking / Jae-Ha Lee / Masafumi Yamashita / Diane L. Souvaine / Sariel Har-Peled / /
Position
guard / /
ProvinceOrState
New York / Ontario / /
PublishedMedium
SIAM Journal on Computing / /
Technology
polynomial time algorithm / time algorithm / shortest path algorithms / polynomial time algorithms / /
CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract