Back to Results
First PageMeta Content
Operations research / Search algorithms / Network flow / Routing algorithms / Canadian traveller problem / Shortest path problem / Breadth-first search / Flow network / Tree / Graph theory / Mathematics / Theoretical computer science


Canadians Should Travel Randomly⋆ Erik D. Demaine1 , Yamming Huang2 , Chung-Shou Liao2 , and Kunihiko Sadakane3 1 Computer Science and Artificial Intelligence Laboratory,
Add to Reading List

Document Date: 2014-06-27 14:12:19


Open Document

File Size: 133,81 KB

Share Result on Facebook

City

Tokyo / Cambridge / /

Company

Kao / /

Country

Taiwan / Japan / United States / /

/

Facility

National Tsing Hua University / Massachusetts Institute of Technology / National Institute of Informatics / Artificial Intelligence Laboratory / /

IndustryTerm

deterministic algorithms / expected total travel cost / expected travel cost / depth-first search order / road network / breadthfirst search traversing / online approximation algorithms / randomized online algorithms / randomized algorithm / travel cost / adaptive algorithm / depth-first search / greedy algorithm / deterministic online algorithm / maximum travel cost / shortest travel cost / online algorithm / breadth-first search / proposed randomized algorithm / online algorithms / given travel time / /

Organization

Department of Industrial Engineering and Engineering Management / Massachusetts Institute of Technology / National Institute of Informatics / National Tsing Hua University / Computer Science and Artificial Intelligence Laboratory / /

ProvinceOrState

Massachusetts / /

Technology

online algorithm / proposed randomized algorithm / randomized algorithm / online approximation algorithms / randomized online algorithms / GA algorithm / 3 Main Algorithm / deterministic online algorithm / greedy algorithm / GRR algorithm / adaptive algorithm / online randomized algorithm / /

SocialTag