CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† - Stabbing - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen† Add to Reading List Document Date: 2013-08-11 21:51:57 Open Document File Size: 324,12 KB Share Result on Facebook City Waterloo / / Company Oxford University Press / Vertex / / Country Israel / Czech Republic / / Currency SCR / / / Facility Charles University / Caesarea Rothschild Institute / University of Haifa / / IndustryTerm poly-time solution / polytime solution / approximation algorithm / / Organization Department of Applied Mathematics / Charles University in Prague / University of Haifa / Oxford University / Caesarea Rothschild Institute / / Position visiting researcher / / ProvinceOrState Ontario / / RadioStation Katz / / Technology approximation algorithm / / SocialTag NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen†Add to Reading List