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 the normal view instead:
scientific article; zbMATH DE number 6281530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems |
scientific article; zbMATH DE number 6281530 |
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
0.8466519117355347
0 references
0.8331681489944458
0 references
0.8295109868049622
0 references
