Back to Results
First PageMeta Content
Tree decomposition / Graph / Dynamic programming / Tree / Shortest path problem / Path decomposition / Planar separator theorem / Graph theory / Mathematics / Theoretical computer science


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Application of computational geometry to network p-center location problems Binay Bhattacharya
Add to Reading List

Document Date: 2008-10-29 00:10:51

Open Document

File Size: 182,06 KB

Share Result on Facebook

Company

SIAM Journal / /

Country

Canada / /

/

Facility

Simon Fraser University / /

IndustryTerm

input network / constant treewidth networks / priority search tree / local p-center solution / faster algorithm / p-center solutions / 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 / pcenter solution / /

Organization

Universidad Complutense / Simon Fraser University / /

Position

mp / /

Technology

Our algorithm / improved algorithm / time algorithm / /

SocialTag