Limited packing and multiple domination problems: polynomial time reductions (Q2448892)
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: Limited packing and multiple domination problems: polynomial time reductions |
scientific article; zbMATH DE number 6292059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limited packing and multiple domination problems: polynomial time reductions |
scientific article; zbMATH DE number 6292059 |
Statements
Limited packing and multiple domination problems: polynomial time reductions (English)
0 references
5 May 2014
0 references
\(k\)-tuple dominating set
0 references
\(k\)-limited packing
0 references
computational complexity
0 references
polynomial time reductions
0 references
0 references
0 references
0.9229774475097656
0 references
0.8733693957328796
0 references
0.7956060767173767
0 references
0.7729752659797668
0 references
0.7625194787979126
0 references
