Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145)
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: Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems |
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
0 references
0 references
0 references
