Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities (Q4764340)
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 750737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities |
scientific article; zbMATH DE number 750737 |
Statements
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities (English)
0 references
4 May 1995
0 references
performance guarantee
0 references
parametrized triangle inequality
0 references
minimum Steiner tree
0 references
anticlustering
0 references
traveling salesman
0 references
worst-case analyses of heuristics
0 references
approximation algorithms
0 references
0.8435816168785095
0 references
0.82313072681427
0 references
0.7737424373626709
0 references
0.7667512893676758
0 references
