Completeness in approximation classes
type: Item
instance of: scholarly article
title: Completeness in approximation classes
zbMATH Open document ID: 0734.68039
DOI: 10.1016/0890-5401(91)90025-W
author: Pilu Crescenzi
author: Alessandro Panconesi
published in: Information and Computation
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 4215357
zbMATH Keywords: NP-complete problems
zbMATH Keywords: approximable problems within a constant
zbMATH Keywords: polynomial time approximation scheme
MaRDI profile type: Publication
cites work: Structure preserving reductions among convex optimization problems
cites work: Toward a unified approach for the classification of NP-complete optimization problems
cites work: Q3484326
cites work: Q4138187
cites work: Q4198056
cites work: On simple and creative sets in NP
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: The complexity of optimization problems
cites work: Q3912008
cites work: On the Structure of Polynomial Time Reducibility
cites work: Non deterministic polynomial optimization problems and their approximations
cites work: Q4739657
cites work: Algorithms for Scheduling Independent Tasks
description: scientific article; zbMATH DE number 4215357