A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unit disk graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for connected dominating sets / 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: Simple heuristics for unit disk graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:47, 10 June 2024
scientific article; zbMATH DE number 2216284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS |
scientific article; zbMATH DE number 2216284 |
Statements
A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (English)
0 references
19 October 2005
0 references
connected dominating set
0 references
2-independent set
0 references
minor
0 references
approximation algorithm
0 references
