An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.3934/jimo.2012.8.117 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.3934/JIMO.2012.8.117 / rank | |||
Normal rank | |||
Latest revision as of 04:51, 18 December 2024
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
