Back to Results
First PageMeta Content
Operations research / NP-complete problems / Approximation algorithm / Computational complexity theory / Facility location / Circle / Travelling salesman problem / Tower of Hanoi / Theoretical computer science / Geometry / Mathematics


CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract
Add to Reading List

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

Open Document

File Size: 113,72 KB

Share Result on Facebook

City

Logan / Milwaukee / /

Company

H. Mahini A. S. / SIAM Journal / 3SAT / Vertex / /

Country

United States / /

/

Facility

Utah State University / University of Wisconsin / /

IndustryTerm

polynomial-time approximation algorithm / polynomial-time exact algorithm / client-server / feasible solution / approximation algorithm / binary search / polynomial-time algorithm / nearest server / fixed parameter tractable algorithm / approximation algorithms / /

Organization

Minimizing / Facility-location Movement / National Science Foundation / Department of Computer Science / ACM Transactions on Algorithms / Utah State University / Facilitylocation Movement / University of Wisconsin / /

Person

Discrete Applied / /

/

ProvinceOrState

Wisconsin / Utah / /

PublishedMedium

SIAM Journal on Computing / Theory of Computing / /

Technology

polynomial-time approximation algorithm / 1.61-approximation algorithm / approximation algorithm / polynomial-time algorithm / 1.87approximation algorithm / 1.87-approximation algorithm / approximation algorithms / fixed parameter tractable algorithm / 1.71-approximation algorithm / /

SocialTag