On the hardness of approximating minimization problems
type: Item
instance of: scholarly article
title: On the hardness of approximating minimization problems
zbMATH Open document ID: 0814.68064
DOI: 10.1145/185675.306789
author: Mihalis Yannakakis
author: C. Lund
published in: Journal of the ACM
publication date: 1995-02-20T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 724769
zbMATH Keywords: graph coloring
zbMATH Keywords: set covering
zbMATH Keywords: minimization problems
Wikidata QID: Q55966575
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/185675.306789
OpenAlex ID: W2059453880
DBLP publication ID: journals/jacm/LundY94
description: scientific article; zbMATH DE number 724769