2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: I. I. Ëremin / rank | |||
| Property / author | |||
| Property / author: E. Kh. Gimadi / rank | |||
| Property / author | |||
| Property / author: Alexander Kel'Manov / rank | |||
| Property / author | |||
| Property / author: Artem V. Pyatkin / rank | |||
| Property / author | |||
| Property / author: Q463370 / rank | |||
Revision as of 17:56, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-approximation algorithm for finding a clique with minimum weight of vertices and edges |
scientific article |
Statements
2-approximation algorithm for finding a clique with minimum weight of vertices and edges (English)
0 references
17 December 2014
0 references
complete undirected graph
0 references
clique of fixed size
0 references
minimum weight of vertices and edges
0 references
subset search
0 references
approximability
0 references
polynomial time approximation algorithm
0 references
approximation guarantee
0 references
time complexity
0 references
