Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph |
scientific article; zbMATH DE number 6474027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph |
scientific article; zbMATH DE number 6474027 |
Statements
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (English)
0 references
20 August 2015
0 references
search for vertex-disjoint cliques
0 references
minimum total weight of vertices and edges
0 references
approximation algorithm
0 references
performance guarantee
0 references
attainable bounds
0 references
metric problem
0 references
quadratic Euclidean problem
0 references
0 references
0 references
0 references
