Open AccessParameterized Approximation Scheme for the Multiple Knapsack Problem
Author(s) -
Klaus Jansen
Publication year - 2009
Publication title -
proceedings of the twentieth annual acm-siam symposium on discrete algorithms
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1137/1.9781611973068.73
Subject(s) - knapsack problem , parameterized complexity , polynomial time approximation scheme , bin packing problem , mathematics , combinatorics , generalization , approximation algorithm , discrete mathematics , bin , combinatorial optimization , continuous knapsack problem , mathematical optimization , computer science , algorithm , mathematical analysis