On an approximation measure founded on the links between optimization and polynomial approximation theory
- 1 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 158 (1-2) , 117-141
- https://doi.org/10.1016/0304-3975(95)00060-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On an approximation measure founded on the links between optimization and polynomial approximation theoryTheoretical Computer Science, 1996
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- On Approximate Solutions for Combinatorial Optimization ProblemsSIAM Journal on Discrete Mathematics, 1990
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975