scientific article; zbMATH DE number 3705908

MaRDI QIDQ3898034zbMATH OpenFDO

Authors Georgij Gens, Evgenij Levner

Publication date 1980

zbMATH Keywords

combinatorial problemscomplexity of approximation algorithmssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68Rxx)

Cited in

(10)

• Parallel approximation schemes for subset sum and knapsack problems
• 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
• Online removable knapsack problem under convex function
• 2D knapsack: packing squares
• Online removable knapsack with limited cuts
• An FPTAS for connectivity interdiction
• An FPTAS for connectivity interdiction
• There is no EPTAS for two-dimensional knapsack
• Online minimization knapsack problem

This page was built for publication:

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