Back to Results
First PageMeta Content
Computational geometry / Simple polygon / Travelling salesman problem / Mathematics / Applied mathematics / Art gallery problem


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, Ramesh Krishnamurti †,
Add to Reading List

Document Date: 2008-10-28 21:28:40

Open Document

File Size: 185,68 KB

Share Result on Facebook

City

Ottawa / Mumbai / Burnaby / /

Company

SIAM Journal / C. Cambridge University Press / /

Country

Canada / India / /

/

Facility

Simon Fraser University / Tata Institute of Fundamental Research / /

IndustryTerm

potential applications / robotic applications / approximation algorithm / feasible solution / travel cost / proposed sampling algorithm / approximation solution / related approximation algorithms / online algorithms / polylogorithmic approximation algorithm / travel tradeoff / Approximation algorithms / poly-log approximation algorithm / /

Organization

Cambridge University / School of Computing Science / School of Engineering Science / Tata Institute of Fundamental Research / Algorithmic Foundation of Robotics / Simon Fraser University / /

Person

Kamal Gupta / Ramesh Krishnamurti / /

/

Position

Euclidean Traveling Salesman / /

ProvinceOrState

British Columbia / Arkansas / Ontario / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / IEEE Transactions on Information Theory / Theoretical Computer Science / /

Technology

sampling algorithm / LP-based rounding algorithm / poly-log approximation algorithm / resulting algorithm / proposed algorithm / approximation algorithm / proposed sampling algorithm / Approximation algorithms / polylogorithmic approximation algorithm / Dom / related approximation algorithms / 4 Sampling Algorithm / /

SocialTag