Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177): 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.1023/a:1026094110647 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W424054382 / rank | |||
Normal rank | |||
Latest revision as of 09:02, 30 July 2024
scientific article
| 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 |
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
