Title of article
NEW APPROXIMATION GUARANTEES FOR MINIMUM-WEIGHT k-TREES AND PRIZE-COLLECTING SALESMEN
Author/Authors
AWERHUCH، BARUCH نويسنده , , AZAR، YOSSI نويسنده , , BLUM، AVRIM نويسنده , , VEMPALA، SANTOSH نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-253
From page
254
To page
0
Abstract
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords
approximation algorithm , k-MST , prize-collecting traveling salesman problem
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16441
Link To Document