On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7444807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs |
scientific article; zbMATH DE number 7444807 |
Statements
On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (English)
0 references
14 December 2021
0 references
NP-hard
0 references
liar's domination
0 references
approximation algorithms
0 references
inapproximability
0 references
0 references
0.7886618375778198
0 references
0.7805721759796143
0 references
0.7753981947898865
0 references
0.7691709399223328
0 references
0.7660576701164246
0 references
