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
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6596618 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithms | |||
| Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Euclidean \( m\)-PSP | |||
| Property / zbMATH Keywords: Euclidean \( m\)-PSP / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
metric \( m\)-weighted clique problem | |||
| Property / zbMATH Keywords: metric \( m\)-weighted clique problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\( m\)-layer planar assignment problem | |||
| Property / zbMATH Keywords: \( m\)-layer planar assignment problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
performance guarantees | |||
| Property / zbMATH Keywords: performance guarantees / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
asymptotic optimality | |||
| Property / zbMATH Keywords: asymptotic optimality / rank | |||
Normal rank | |||
Revision as of 22:35, 27 June 2023
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
