2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6381066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-approximation algorithm for finding a clique with minimum weight of vertices and edges |
scientific article; zbMATH DE number 6381066 |
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
0.8177566528320312
0 references
0.7879824042320251
0 references
0.7836397886276245
0 references
0.7736896276473999
0 references
0.7731289267539978
0 references
