CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡ - Programming complexity - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡ Add to Reading List Document Date: 2014-06-20 06:19:10 Open Document File Size: 479,32 KB Share Result on Facebook City Halifax / Punjab140001 / / Company Springer International Publishing / / Country India / / / Facility Indian Institute of Technology Ropar / / IndustryTerm polynomial time algorithm / possible optimal solutions / / Organization Department of Computer Science and Engineering / ETA / Indian Institute of Technology Ropar / / Person Mustafa / Ray / / ProvinceOrState Nova Scotia / / PublishedMedium Lecture Notes in Computer Science / / RadioStation Nova / / Technology polynomial time algorithm / / SocialTag Mathematical logic Computational complexity theory Gadget Clause Variable Theoretical computer science Mathematics Logic programming

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡Add to Reading List