An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849)
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 6732033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation |
scientific article; zbMATH DE number 6732033 |
Statements
An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (English)
0 references
16 June 2017
0 references
2-catalog segmentation problem
0 references
approximation algorithm
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0.8884620070457458
0 references
0.8466519117355347
0 references
0.8053916692733765
0 references
