On an approximation measure founded on the links between optimization and polynomial approximation theory
type: Item
instance of: scholarly article
title: On an approximation measure founded on the links between optimization and polynomial approximation theory
zbMATH Open document ID: 0871.90069
DOI: 10.1016/0304-3975(95)00060-7
author: Marc Demange
author: Vangelis Th. Paschos
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 41A10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984393
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00060-7
OpenAlex ID: W2001258377
cites work: Heuristic evaluation techniques for bin packing approximation algorithms
cites work: Q4230322
cites work: Structure preserving reductions among convex optimization problems
cites work: Q3941433
cites work: Q3682518
cites work: Q4291269
cites work: Q3142706
cites work: Improved approximations for maximum independent set via approximation chains
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Q3960718
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Optimization, approximation, and complexity classes
cites work: P-Complete Approximation Problems
cites work: On Approximate Solutions for Combinatorial Optimization Problems
description: scientific article; zbMATH DE number 984393