Back to Results
First PageMeta Content
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


Packing a Knapsack of Unknown Capacity Yann Disser∗ , Max Klimm, Nicole Megow† , and Sebastian Stiller Department of Mathematics, Technische Universität Berlin, Germany {disser,klimm,nmegow,stiller}@math.tu-berlin.d
Add to Reading List

Document Date: 2014-06-06 08:08:21

Open Document

File Size: 571,91 KB

Share 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