On the hardness of approximating minimization problems (Q4323730): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q2453542 |
Created claim: DBLP publication ID (P1635): journals/jacm/LundY94, #quickstatements; #temporary_batch_1731543907597 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Carstent Lund / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/185675.306789 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059453880 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/LundY94 / rank | |||
Normal rank | |||
Latest revision as of 01:57, 14 November 2024
scientific article; zbMATH DE number 724769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating minimization problems |
scientific article; zbMATH DE number 724769 |
Statements
On the hardness of approximating minimization problems (English)
0 references
20 February 1995
0 references
graph coloring
0 references
set covering
0 references
minimization problems
0 references
