<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-28 07:19:03Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†DocID: 1uhJD - View Document |
| An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.deDocID: 1qMfK - View Document |
| Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios ·DocID: 1ppRS - View Document |
| Packing Squares into a Square is Strongly NP-complete 𝑥𝑥 𝑥𝑥 𝐵𝐵 + 𝑎𝑎𝑖𝑖DocID: 1m0cj - View Document |
| Simple Folding is Strongly NP-Complete Hugo A. Akitaya∗ Erik D. Demaine† Jason S. Ku‡DocID: 1lSw1 - View Document |