In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter.
Jan 26, 2017 · The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problem may need to output ...
First fully polynomial-time approximation scheme (FPTAS) for the problem without additional requirements on the input data.
Mar 17, 2017 · In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form w_i(\lambda) = a_i + \lambda \ ...
Mar 20, 2021 · Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. Algorithm Design by J. Kleinberg and E. Tardos.
Missing: parametric | Show results with:parametric
Oct 22, 2024 · In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form w i ( λ ) ...
Abstract. In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form wi(λ) = ai + λ ...
Abstract: In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter.
An FPTAS for the parametric knapsack problem | Request PDF
www.researchgate.net › publication › 38...
Dec 15, 2024 · In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued ...
Jan 1, 2016 · The 0–1 knapsack problem is NP-hard, but it admits a fully polynomial time approximation scheme (FPTAS) and can be solved exactly in pseudo- ...