Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs (Q2867320)
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: Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs |
scientific article; zbMATH DE number 6237440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs |
scientific article; zbMATH DE number 6237440 |
Statements
11 December 2013
0 references
approximation algorithms
0 references
approximation hardness
0 references
identifying codes
0 references
locating-dominating codes
0 references
fault tolerance
0 references
domination problems
0 references
combinatorial optimization
0 references
graph algorithms
0 references
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs (English)
0 references
0.8987927436828613
0 references
0.8826388716697693
0 references
0.8603082299232483
0 references
0.852695643901825
0 references
0.8371164202690125
0 references
