| Document Date: 2011-08-06 04:11:12
Open Document File Size: 150,90 KBShare Result on Facebook
/ Facility University of Waterloo / / IndustryTerm constant and almost-constant approximation algorithms / geometric set systems / local search technique / dynamic programming algorithm / polynomial-time dynamic programming algorithm / polynomial-time exact algorithm / circuit-printing / feasible solution / local search method / wireless network design / similar algorithm / feasible solutions / approximation algorithms / poly-time dynamic programming algorithm / / Organization David R. Cheriton School of Computer Science / University of Waterloo / Department of Combinatorics and Optimization / / Person Ray / Mustafa / / Technology similar algorithm / poly-time dynamic programming algorithm / polynomial-time dynamic programming algorithm / approximation algorithms / dynamic programming algorithm / SNP / image compression / 4 Algorithm / /
SocialTag |
CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract