Title of article :
A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR THE GEOMETRIC k-MST PROBLEM IN THE PLANE
Author/Authors :
BLUM، AVRIM نويسنده , , VEMPALA، SANTOSH نويسنده , , MITCHELL، JOSEPH S. B. نويسنده , , CHALASANI، PRASAD نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
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 :
quota, traveling salesman problem , hank robber (orienteering) problem , network optimization , prize-collecting salesman problem , Computational geometry , Dynamic Programming , k-MST, guillotine subdivisions , approximation algorithms polynomial , Eminimum spanning trees
Journal title :
SIAM Journal on Computing
Journal title :
SIAM Journal on Computing
