Strongly Polynomial FPTASes for Monotone Dynamic Programs
Tzvi Alon, Nir Halman
Topics & Concepts
Knapsack problemPolynomial-time approximation schemeMonotone polygonMathematicsTime complexityPolynomialTheory of computationApproximation algorithmTupleCombinatoricsDiscrete mathematicsMathematical optimizationComputer scienceAlgorithmMathematical analysisGeometryOptimization and Search ProblemsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs