Dynamic programming on the word RAM

DOI10.1007/S00453-002-0989-YMaRDI QIDQ1566379zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David Pisinger

Publication date 2 June 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-0989-y

zbMATH Keywords

Dynamic programmingKnapsack problemBinary encodingWord RAM

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Dynamic programming on a functional memory computer
• scientific article; zbMATH DE number 1260458
• scientific article; zbMATH DE number 1431652
• scientific article; zbMATH DE number 53073
• Dynamic programming
• scientific article; zbMATH DE number 5866260
• scientific article; zbMATH DE number 1670814
• Parallel RAM algorithms for factorizing words
• Linear-time in-place DFS and BFS on the word RAM
• Dynamic data structures for approximate Hausdorff distance in the word RAM

Cited in

(12)

• The unbounded knapsack problem
• Exact cover with light
• Algorithms in the ultra-wide word model
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Tight bounds for the identical parallel machine scheduling problem
• Where are the hard knapsack problems?
• scientific article; zbMATH DE number 1670814 (Why is no real title available?)
• Maximizing the minimum completion time on parallel machines
• Expectation analysis for bounding solutions of the 0-1 knapsack problem
• Homomorphic hashing for sparse coefficient extraction
• Limitations of incremental dynamic programming
• An improved balanced algorithm for the subset-sum problem

This page was built for publication: Dynamic programming on the word RAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566379)