Toward a unified approach for the classification of NP-complete optimization problems
type: Item
instance of: scholarly article
title: Toward a unified approach for the classification of NP-complete optimization problems
zbMATH Open document ID: 0442.68029
DOI: 10.1016/0304-3975(80)90006-7
author: Marco Protasi
author: Giorgio Ausiello
author: Alberto Marchetti-Spaccamela
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3690683
zbMATH Keywords: NP-complete optimization
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90006-7
OpenAlex ID: W2053548601
cites work: Q4133133
cites work: Q3920645
cites work: Q4161330
cites work: `` Strong '' NP-Completeness Results
cites work: Limiting recursion
cites work: Q4140381
cites work: Q4077442
cites work: Q4142699
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Q4125769
cites work: Heuristic evaluation techniques for bin packing approximation algorithms
cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
description: scientific article; zbMATH DE number 3690683