ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Correlation clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Multiterminal Cuts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some optimal inapproximability results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054107004656 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013850148 / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS |
scientific article |
Statements
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (English)
0 references
25 April 2007
0 references
approximation algorithm
0 references
clustering
0 references
clique partition
0 references
inapproximability
0 references
DNA clone classification
0 references
