Approximability of identifying codes and locating-dominating codes (Q2379937)
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: Approximability of identifying codes and locating-dominating codes |
scientific article; zbMATH DE number 5686385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of identifying codes and locating-dominating codes |
scientific article; zbMATH DE number 5686385 |
Statements
Approximability of identifying codes and locating-dominating codes (English)
0 references
24 March 2010
0 references
approximation algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
identifying codes
0 references
locating-dominating codes
0 references
0 references
0.8987927436828613
0 references
0.8700957894325256
0 references
0.8134467601776123
0 references
0.8093694448471069
0 references
