Title of article
FINDING THE k SHORTEST PATHS
Author/Authors
EPPSTKTN، DAVID نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-651
From page
652
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
genealogy , shortestths , network programming , path cnumeration , near-optimell solutions , Dynamic Programming , knapsack problem , sequence alignment , insscribed polygon
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16489
Link To Document