New algorithms for the weighted maximum cut problem on graphs (Q1907796)
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 844548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for the weighted maximum cut problem on graphs |
scientific article; zbMATH DE number 844548 |
Statements
New algorithms for the weighted maximum cut problem on graphs (English)
0 references
27 March 1996
0 references
NP-complete
0 references
weighted maximum cut problem
0 references
theory of dual estimates
0 references
nonsmooth optimization
0 references
algorithm
0 references
0 references
0.8450779914855957
0 references
0.8118618130683899
0 references
0.8117926716804504
0 references
0.8082048892974854
0 references
0.8064530491828918
0 references
