It is hard to know when greedy is good for finding independent sets (Q286978): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585370 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
analysis of algorithms | |||
| Property / zbMATH Keywords: analysis of algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial problems | |||
| Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithms | |||
| Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | It is hard to know when greedy is good for finding independent sets |
scientific article |
Statements
It is hard to know when greedy is good for finding independent sets (English)
0 references
26 May 2016
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
approximation algorithms
0 references
