Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177)
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 MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH |
scientific article; zbMATH DE number 2069153
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH |
scientific article; zbMATH DE number 2069153 |
Statements
Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (English)
0 references
27 May 2004
0 references
max \(\frac{n}2\)-directed-bisection
0 references
max \(\frac{n}2\)-dense-subgraph
0 references
Polynomial-time approximation algorithm
0 references
Semidefinite programming
0 references
0.91773397
0 references
0.91487765
0 references
0.90979546
0 references
0.8945033
0 references
0.89126974
0 references
0.89123476
0 references
