Approximation algorithms for the traveling purchaser problem and its variants in network design (Q4938770)
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 1405785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the traveling purchaser problem and its variants in network design |
scientific article; zbMATH DE number 1405785 |
Statements
23 February 2000
0 references
traveling purchaser problem
0 references
Steiner tree problems
0 references
poly-logarithmic worst-case ratio
0 references
LP relaxation
0 references
0.7761877775192261
0 references
0.7719143033027649
0 references
0.7656124234199524
0 references
0.7652422785758972
0 references
0.7631872892379761
0 references
Approximation algorithms for the traveling purchaser problem and its variants in network design (English)
0 references
