A tight approximation algorithm for the cluster vertex deletion problem (Q5925651): 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.1007/s10107-021-01744-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3042827292 / rank | |||
Normal rank | |||
Revision as of 23:40, 19 March 2024
scientific article; zbMATH DE number 7662926
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight approximation algorithm for the cluster vertex deletion problem |
scientific article; zbMATH DE number 7662926 |
Statements
A tight approximation algorithm for the cluster vertex deletion problem (English)
0 references
14 March 2023
0 references
approximation algorithm
0 references
cluster vertex deletion
0 references
linear programming relaxation
0 references
Sherali-Adams hierarchy
0 references
