Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-012-9526-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063687001 / rank | |||
Normal rank | |||
Revision as of 19:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems |
scientific article |
Statements
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (English)
0 references
8 April 2014
0 references
max-bisection problem
0 references
2-catalog segmentation problem
0 references
approximation algorithm
0 references
semidefinite programming
0 references
RPR\(^{2}\) rounding
0 references
