Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417): Difference between revisions
From MaRDI portal
Latest revision as of 04:44, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph |
scientific article |
Statements
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (English)
0 references
22 June 2016
0 references
approximation algorithms
0 references
Euclidean \( m\)-PSP
0 references
metric \( m\)-weighted clique problem
0 references
\( m\)-layer planar assignment problem
0 references
performance guarantees
0 references
asymptotic optimality
0 references
0 references
0 references
0 references
