F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning

First Page		Document Content
Date: 2008-09-30 05:19:33 NP-complete problems Mathematical optimization Operations research Dynamic programming Partition problem Search algorithms Subset sum problem Greedy algorithm Genetic algorithm Theoretical computer science Mathematics Applied mathematics		F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning Add to Reading List Source URL: ijcai.org Download Document from Source Website File Size: 157,22 KB Share Document on Facebook

	An FPTAS for the Subset Sum Problem Margarida Mamede, DI – FCT/UNL DocID: 1sYqA - View Document
	The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th DocID: 1skX8 - View Document
	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA DocID: 1qWOd - View Document
	Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English) DocID: 1oxHC - View Document
	Quantum algorithms for the subset-sum problem D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: DocID: 1ltaX - View Document