CCCG 2009, Vancouver, BC, August 17–19, 2009 Packing 2 × 2 unit squares into grid polygons is NP-complete Dania El-Khechen∗ 1

First Page		Document Content
Date: 2009-09-02 14:19:26 Complexity classes Discrete geometry Packaging Packing problem Sphere packing NP-hard Polygon Induced path NP-complete Theoretical computer science Mathematics Geometry		CCCG 2009, Vancouver, BC, August 17–19, 2009 Packing 2 × 2 unit squares into grid polygons is NP-complete Dania El-Khechen∗ 1 Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 179,40 KB Share Document on Facebook

	ZL000_00_021e_WL Guidance document Packaging for human medicinal products HMV4 DocID: 1xUPn - View Document
	PDF Document DocID: 1xJlx - View Document
	PDF Document DocID: 1xjGg - View Document
	PDF Document DocID: 1xcVu - View Document
	PDF Document DocID: 1x3TU - View Document