Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417)
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 6596618
| 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 discrete disjoint subgraphs in complete weighted graph |
scientific article; zbMATH DE number 6596618 |
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.90946454
0 references
0.87751305
0 references
0.87737906
0 references
0.87193334
0 references
0.8703071
0 references
0.8644589
0 references
