<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-28 07:19:02NP-complete problems NP-complete Set cover problem Vertex cover Approximation algorithm Greedy algorithm P versus NP problem NP Linear programming Theoretical computer science Computational complexity theory Mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | Greedy algorithm for large scale Nonnegative matrix/tensor decomposition ✦DocID: 1tDWz - View Document |
| The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗DocID: 1sdbY - View Document |
| Prof. Dr. Roger Wattenhofer phone +fax +Diploma/Master’s Thesis “Comparison of Ad Hoc Routing Algorithms”DocID: 1rmcF - View Document |
| Advances in Cognitive SystemsSubmitted; publishedVariations on a Theory of Problem Solving Pat LangleyDocID: 1r7U5 - View Document |
| Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the proDocID: 1qYO3 - View Document |