Back to Results
First PageMeta Content
Dynamic programming / Vehicle Identification Number / Tree / Graph / Path decomposition / Graph theory / Mathematics / Tree decomposition


1 Application of computational geometry to network p-center location problems Binay Bhattacharya
Add to Reading List

Document Date: 2008-10-28 23:59:59


Open Document

File Size: 226,15 KB

Share Result on Facebook

Company

SIAM Journal / McGraw-Hill Book Company / The MIT Press / /

Country

Canada / /

/

Facility

Simon Fraser University / /

IndustryTerm

input network / constant treewidth networks / priority search tree / local p-center solution / faster algorithm / p-center solutions / linear-time algorithm / weighted undirected network / possible solutions / cactus networks / partial k-tree network / sequential algorithms / binary search / cartesian product / balanced binary search tree / possible 2center solution / improved algorithms / p-center solution / /

Organization

Universidad Complutense / School of Computing Science / MIT / Simon Fraser University / /

Position

mp / /

Technology

Our algorithm / improved algorithm / linear-time algorithm / time algorithm / /

SocialTag