Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems (Q5384085)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems |
scientific article; zbMATH DE number 7069441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems |
scientific article; zbMATH DE number 7069441 |
Statements
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems (English)
0 references
20 June 2019
0 references
0.9841682314872742
0 references
0.8551799058914185
0 references
0.8497680425643921
0 references
0.8334506750106812
0 references
0.8334506750106812
0 references
