Journal of Combinatorial Optimization

, Volume 8, Issue 1, pp 5–11

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

  • Hans Kellerer
  • Ulrich Pferschy
Article

DOI: 10.1023/B:JOCO.0000021934.29833.6b

Cite this article as:
Kellerer, H. & Pferschy, U. Journal of Combinatorial Optimization (2004) 8: 5. doi:10.1023/B:JOCO.0000021934.29833.6b

Abstract

A vector merging problem is introduced where two vectors of length n are merged such that the k-th entry of the new vector is the minimum over ℓ of the ℓ-th entry of the first vector plus the sum of the first k − ℓ + 1 entries of the second vector. For this problem a new algorithm with O(n log n) running time is presented thus improving upon the straightforward O(n2) time bound.

The vector merging problem can appear in different settings of dynamic programming. In particular, it is applied for a recent fully polynomial time approximation scheme (FPTAS) for the classical 0–1 knapsack problem by the same authors.

dynamic programming knapsack problem fully polynomial approximation scheme 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Hans Kellerer
    • 1
  • Ulrich Pferschy
    • 1
  1. 1.Department of Statistics and Operations ResearchUniversity of GrazGrazAustria

Personalised recommendations