On the complexity of the {\(k\)}-packing function problem (Q2968508)
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: On the complexity of the {k}-packing function problem |
scientific article; zbMATH DE number 6695710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the {\(k\)}-packing function problem |
scientific article; zbMATH DE number 6695710 |
Statements
On the complexity of the {<i>k</i>}-packing function problem (English)
0 references
16 March 2017
0 references
chordal graph
0 references
NP-completeness
0 references
polynomial instances
0 references
0 references
0.9394733309745787
0 references
0.888473391532898
0 references
0.8528764247894287
0 references
0.8299158215522766
0 references
0.7713721990585327
0 references
