Title of article :
GUILLOTINE SUBDIVISIONS APPROXIMATE POLYGONAL SUBDIVISIONS: A SIMPLE POLYNOMIAL-TIME APPROXIMATION SCHEME FOR GEOMETRIC TSP, k-MST AND RELATED PROBLEMS
Author/Authors :
MITCHELL، JOSEPH S. B. نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-1297
From page :
1298
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 algorithms , traveling sales-person problem , k-MST , Steiner minimal trees , guillotine subdivisions , Computational geometry , polynomial-time approximation scheme
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16567
Link To Document :
بازگشت