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

First Page		Document Content
Date: 2013-08-11 21:51:57 NP-complete problems Vertex cover Reduction Ordinal number Parameterized complexity Cardinality APX Set cover problem Polygonal chain Theoretical computer science Computational complexity theory Mathematics		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 Source URL: www.cccg.ca Download Document from Source Website File Size: 324,12 KB Share Document on Facebook

	Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer School DocID: 1vk0H - View Document
	Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary DocID: 1v7gN - View Document
	Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School DocID: 1uKug - View Document
	Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗ DocID: 1uqiK - View Document
	Parameterized complexity of even/odd subgraph problems DocID: 1up1m - View Document