FINDING KTH PATHS AND PARA-CENTERS BY GENERATING AND SEARCHING GOOD DATA-STRUCTURES

[1] [Anonymous], 1970, SOVIET MATH DOKL

[2] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67

[3] Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5

[4] BLUM M, 1972, J COMPUT SYST SCI, V7, P448

[5] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 370 - 375

[6] POLYNOMIALLY BOUNDED ALGORITHMS FOR LOCATING P-CENTERS ON A TREE [J]. MATHEMATICAL PROGRAMMING, 1982, 22 (03) : 304 - 315

[7] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) : 50 - 57

[8] Frederickson G.N., 1980, LNCS, V85, P221

[9] THE COMPLEXITY OF SELECTION AND RANKING IN X + Y AND MATRICES WITH SORTED COLUMNS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) : 197 - 208

[10] FREDERICKSON GN, 1980, 12TH P ACM S THEOR C, P420

[1] [Anonymous], 1970, SOVIET MATH DOKL

[2] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67

[3] Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5

[4] BLUM M, 1972, J COMPUT SYST SCI, V7, P448

[5] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 370 - 375

[6] POLYNOMIALLY BOUNDED ALGORITHMS FOR LOCATING P-CENTERS ON A TREE [J]. MATHEMATICAL PROGRAMMING, 1982, 22 (03) : 304 - 315

[7] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) : 50 - 57

[8] Frederickson G.N., 1980, LNCS, V85, P221

[9] THE COMPLEXITY OF SELECTION AND RANKING IN X + Y AND MATRICES WITH SORTED COLUMNS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) : 197 - 208

[10] FREDERICKSON GN, 1980, 12TH P ACM S THEOR C, P420