메뉴 건너뛰기




Volumn 4, Issue 1, 2000, Pages 79-98

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *

Author keywords

Euclidean metric; Heuristics; Orientation metric; Rectilinear metric; Steiner tree problems

Indexed keywords


EID: 0004694289     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009837006569     Document Type: Article
Times cited : (5)

References (25)
  • 1
    • 56449107505 scopus 로고
    • OR-library: Distributing test problem by electronic mail
    • J.E. Beasley, "OR-library: Distributing test problem by electronic mail," Journal of the Operational Research Society, vol. 41, pp. 1069-1072, 1990. http://mscmga.ms.ic.ac.uk/.
    • (1990) Journal of the Operational Research Society , vol.41 , pp. 1069-1072
    • Beasley, J.E.1
  • 2
    • 0026853351 scopus 로고
    • A heuristic for euclidean and rectilinear steiner problems
    • J.E. Beasley, "A heuristic for euclidean and rectilinear steiner problems," European Journal of Operational Research, vol. 58, pp. 284-292, 1992.
    • (1992) European Journal of Operational Research , vol.58 , pp. 284-292
    • Beasley, J.E.1
  • 3
    • 84977572524 scopus 로고
    • A delaunay triangulation-based heuristic for the euclidean Steiner problems
    • J.E. Beasley and F. Goffinet, "A delaunay triangulation-based heuristic for the euclidean Steiner problems," Networks, vol. 24, pp. 215-224, 1994.
    • (1994) Networks , vol.24 , pp. 215-224
    • Beasley, J.E.1    Goffinet, F.2
  • 4
    • 0028396124 scopus 로고
    • Rectilinear Steiner tree constructions by local and global refinement
    • T.-H. Chao and Y.-C. Hsu, "Rectilinear Steiner tree constructions by local and global refinement," IEEE Trans. CAD, vol. 13, no. 3, pp. 303-309, 1994.
    • (1994) IEEE Trans. CAD , vol.13 , Issue.3 , pp. 303-309
    • Chao, T.-H.1    Hsu, Y.-C.2
  • 5
    • 0000532866 scopus 로고
    • On the Steiner problem
    • E.J. Cockayne, "On the Steiner problem," Can. Math. Bull., vol. 10, no. 3, pp. 431-450, 1967.
    • (1967) Can. Math. Bull. , vol.10 , Issue.3 , pp. 431-450
    • Cockayne, E.J.1
  • 7
    • 0001193394 scopus 로고
    • Reducing the Steiner problem in a normed space
    • D.Z. Du and F.K. Hwang, "Reducing the Steiner problem in a normed space," SIAM Journal on Computing, vol. 21, pp. 1001-1007, 1992.
    • (1992) SIAM Journal on Computing , vol.21 , pp. 1001-1007
    • Du, D.Z.1    Hwang, F.K.2
  • 9
    • 0000814769 scopus 로고
    • On Steiner's problem with rectilinear distance
    • M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, pp. 255-265, 1966.
    • (1966) SIAM J. Appl. Math. , vol.14 , pp. 255-265
    • Hanan, M.1
  • 10
    • 0025384580 scopus 로고
    • New algorithm for the rectilinear Steiner tree problem
    • J.M. Ho, G. Vijayan, and C.K. Wong, "New algorithm for the rectilinear Steiner tree problem," IEEE Trans. CAD, vol. 9, no. 2, pp. 185-193, 1990.
    • (1990) IEEE Trans. CAD , vol.9 , Issue.2 , pp. 185-193
    • Ho, J.M.1    Vijayan, G.2    Wong, C.K.3
  • 12
    • 0026943502 scopus 로고
    • On performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension
    • A.B. Kahng and G. Robins, "On performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension," IEEE Trans. CAD, vol. 11, no. 11, 7, pp. 893-902, 1992.
    • (1992) IEEE Trans. CAD , vol.11 , Issue.7-11 , pp. 893-902
    • Kahng, A.B.1    Robins, G.2
  • 15
    • 0042883416 scopus 로고    scopus 로고
    • Ph.D. thesis, preprint
    • YY Li, Ph.D. thesis, preprint.
    • Li, Y.Y.1
  • 19
    • 0026927206 scopus 로고
    • Hierarchical Steiner tree construction in uniform orientations
    • M. Sarrafzadeh and C.K. Wong, "Hierarchical Steiner tree construction in uniform orientations," IEEE Trans. Computer-Aided Design, vol. 11, pp. 1095-1103, 1992.
    • (1992) IEEE Trans. Computer-Aided Design , vol.11 , pp. 1095-1103
    • Sarrafzadeh, M.1    Wong, C.K.2
  • 20
    • 0040753790 scopus 로고    scopus 로고
    • A modified melzak procedure for computing node-weighted Steiner trees
    • A. Underwood, "A modified melzak procedure for computing node-weighted Steiner trees," Networks, vol. 27, pp. 73-79, 1996.
    • (1996) Networks , vol.27 , pp. 73-79
    • Underwood, A.1
  • 21
    • 0022563785 scopus 로고
    • On some union and intersection problems for polygons with fixed orientations
    • P. Widmayer, YF. Wu, M.D.F. Schlag, and C.K. Wong, "On some union and intersection problems for polygons with fixed orientations," Computing, vol. 36, pp. 183-197, 1986.
    • (1986) Computing , vol.36 , pp. 183-197
    • Widmayer, P.1    Wu, Y.F.2    Schlag, M.D.F.3    Wong, C.K.4
  • 22
    • 0023399869 scopus 로고
    • On some distance problems in fixed orientations
    • P. Widmayer, YF. Wu, and C.K. Wong, "On some distance problems in fixed orientations," SIAM J. Computer, vol. 16, no. 4, 8, pp. 828-746, 1987.
    • (1987) SIAM J. Computer , vol.16 , Issue.4-8 , pp. 828-1746
    • Widmayer, P.1    Wu, Y.F.2    Wong, C.K.3
  • 24
    • 0041165532 scopus 로고    scopus 로고
    • Euclidean Steiner minimum trees: An improved exact algorithm
    • P. Winter and M. Zachariasen, "Euclidean Steiner minimum trees: An improved exact algorithm," Networks, vol. 30, pp. 149-166, 1997.
    • (1997) Networks , vol.30 , pp. 149-166
    • Winter, P.1    Zachariasen, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.