Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291)
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 6763406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions |
scientific article; zbMATH DE number 6763406 |
Statements
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (English)
0 references
22 August 2017
0 references
binary packing
0 references
quadratic constraint
0 references
approximation algorithm
0 references
completely positive rank
0 references
nonnegative rank
0 references
submodular
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7922754287719727
0 references
0.7855406403541565
0 references
0.78463214635849
0 references
0.7777941226959229
0 references
