Back to Results
First PageMeta Content
NP-complete problems / Art gallery problem / Steiner tree problem / Vertex / Connectivity / Pseudotriangle / Tree / Graph / Dominating set / Graph theory / Mathematics / Theoretical computer science


cccg-cluster_visibility-2.dvi
Add to Reading List

Document Date: 2010-07-19 10:46:19

Open Document

File Size: 133,07 KB

Share Result on Facebook

City

Kolkata / /

Company

SIAM Journal / /

Country

India / /

Facility

Institute of Radiophysics / University of Calcutta / National Institute of Technology / India Statistical Institute / /

IndustryTerm

reduction algorithm / sensor network applications / output-sensitive algorithm / approximation algorithm / log n-factor approximation algorithm / output sensitive algorithm / constant factor approximation algorithm / log nfactor approximation algorithm / computing / polynomial time log k-factor approximation algorithm / visibility graph algorithm / sensor network / /

NaturalFeature

D. M. mountain / S. K. mountain / S. mountain / K. mountain / Ghosh mountain / K. Ghosh mountain / S. K. Ghosh mountain / /

Organization

Foundation of Software Technology and Theoretical Computer Science / India Statistical Institute / University of Calcutta / Institute of Technology / Institute of Radiophysics and Electronics / /

Person

Ai / Sanjib Sadhu∗ Arijit Bishnu / /

Position

guard / cooperative guard / Steiner guard / /

ProvinceOrState

Vermont / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / /

Technology

proposed algorithm / approximation algorithm / time algorithm / visibility graph algorithm / 3 Approximation algorithm / log n-factor approximation algorithm / constant factor approximation algorithm / polynomial time log k-factor approximation algorithm / same algorithm / Image Processing / reduction algorithm / log nfactor approximation algorithm / easily be computed using the same algorithm / proposed using the approximation algorithm / /

SocialTag