![Combinatorial optimization / NP-complete problems / Permutations / Cryptography / Knapsack problem / Operations research / Merkle–Hellman knapsack cryptosystem / Fisher–Yates shuffle / Universal property / Theoretical computer science / Mathematics / Computational complexity theory Combinatorial optimization / NP-complete problems / Permutations / Cryptography / Knapsack problem / Operations research / Merkle–Hellman knapsack cryptosystem / Fisher–Yates shuffle / Universal property / Theoretical computer science / Mathematics / Computational complexity theory](https://www.pdfsearch.io/img/98bba964c078c88e246b48b14420d293.jpg)
| Document Date: 2014-06-06 08:08:21 Open Document File Size: 571,91 KBShare Result on Facebook
Company Universal / Creative Commons / Dagstuhl Publishing / / / IndustryTerm knapsack solution / modified greedy algorithm / α-robust solution / classical modified greedy algorithm / optimum solution / approximation algorithms / / Organization German Science Foundation / Megow† / and Sebastian Stiller Department of Mathematics / Technische Universität Berlin / / Person Bouman / Yann Disser / Max Klimm / Nicole Megow / Ernst W. Mayr / Natacha Portier / Sebastian Stiller / / Position model / Dean / model / a universal policy / / ProgrammingLanguage TSP / / Technology capacity C. See Algorithm / approximation algorithms / caching / public key / modified greedy algorithm / classical modified greedy algorithm / Digital Object Identifier / /
SocialTag |