Simple heuristics for unit disk graphs (Q4698229): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4230322 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3975168 / rank | |||
Normal rank | |||
Latest revision as of 13:26, 23 May 2024
scientific article; zbMATH DE number 755103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple heuristics for unit disk graphs |
scientific article; zbMATH DE number 755103 |
Statements
Simple heuristics for unit disk graphs (English)
0 references
12 June 1995
0 references
unit disk graphs
0 references
maximum independent set
0 references
minimum vertex cover
0 references
minimum coloring
0 references
minimum dominating set
0 references
on-line coloring heuristic
0 references
