| Document Date: 2014-07-28 18:32:50
Open Document File Size: 349,77 KBShare Result on Facebook
City Halifax / New York / / Company Oxford University Press / / Country Germany / / / IndustryTerm local search works / faster algorithm / constant-factor approximation algorithm / feasible optimal solution / feasible solution / approximation algorithm / polynomial time algorithm / local search / line-of-sight communication networks / approximation algorithms / / Organization V(ur ) / Department of Computer Science / V(v) / Oxford University / / Person Rourke Supowit / Michael Hemmer∗ Christiane Schmidt / Stephan Friedrichs∗ Michael Hemmer / K. Supowit / Victor Klee / / Position King / guard / finite guard / left-guard / minimum cardinality vertex guard / single guard / black guard / / ProvinceOrState Nova Scotia / New York / / PublishedMedium IEEE Transactions on Information Theory / Lecture Notes in Computer Science / / Technology faster algorithm / constant-factor approximation algorithm / polynomial time algorithm / approximation algorithm / 4-approximation algorithm / approximation algorithms / Improved approximation algorithms / pdf / / URL http /
SocialTag |
CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗