Back to Results
First PageMeta Content
Polygons / NP-complete problems / Computational geometry / Operations research / 3D computer graphics / Art gallery problem / Simple polygon / Travelling salesman problem / Visibility / Geometry / Mathematics / Theoretical computer science


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

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

Open Document

File Size: 98,46 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 / approximation algorithm / travel cost / proposed sampling algorithm / related approximation algorithms / online algorithms / polylogorithmic approximation algorithm / travel tradeoff / Approximation algorithms / poly-log approximation algorithm / /

Organization

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

Person

Kamal Gupta / /

Position

Euclidean Traveling Salesman / /

ProvinceOrState

British Columbia / 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 / 3 3.1 Sampling Algorithm / resulting algorithm / proposed algorithm / approximation algorithm / proposed sampling algorithm / Approximation algorithms / polylogorithmic approximation algorithm / Dom / related approximation algorithms / 4 Sampling Algorithm / /

SocialTag