scientific article
From MaRDI portal
Publication:3898034
zbMath0451.68039MaRDI QIDQ3898034
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68Rxx)
Related Items
Parallel approximation schemes for subset sum and knapsack problems ⋮ 2D knapsack: packing squares ⋮ Online removable knapsack with limited cuts ⋮ Online minimization knapsack problem ⋮ Online removable knapsack problem under convex function ⋮ The preemptive stochastic resource-constrained project scheduling problem ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth ⋮ There is no EPTAS for two-dimensional knapsack