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 this page instead for the normal view: An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation |
scientific article |
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
