
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Guoliang Xue, K. Thulasiraman, "Computing the Shortest Network under a Fixed Topology," IEEE Transactions on Computers, vol. 51, no. 9, pp. 11171120, September, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1032631, author = {Guoliang Xue and K. Thulasiraman}, title = {Computing the Shortest Network under a Fixed Topology}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {9}, issn = {00189340}, year = {2002}, pages = {11171120}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1032631}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Computing the Shortest Network under a Fixed Topology IS  9 SN  00189340 SP1117 EP1120 EPD  11171120 A1  Guoliang Xue, A1  K. Thulasiraman, PY  2002 KW  Steiner trees KW  shortest network under a fixed topology KW  uniform orientation metric plane KW  linear programming. VL  51 JA  IEEE Transactions on Computers ER   
Abstract—We show that, in any given uniform orientation metric plane, the shortest network interconnecting a given set of points under a fixed topology can be computed by solving a linear programming problem whose size is bounded by a polynomial in the number of terminals and the number of legal orientations. When the given topology is restricted to a Steiner topology, our result implies that the Steiner minimum tree under a given Steiner topology can be computed in polynomial time in any given uniform orientation metric with
[1] K.D. Andersen, “An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms,” SIAM J. Optimization, vol. 6, pp. 7495, 1996.
[2] K.D. Andersen, E. Christiansen, A.R. Conn, and M.L. Overton, “An Efficient PrimalDual Interior Point Method for Minimizing a Sum of Euclidean Norms,” SIAM J. Scientific Computing, vol. 22, pp. 243262, 2000.
[3] M. Brazil, D.A. Thomas, and J.F. Weng, “Minimum Networks in Uniform Orientation Metrics,” SIAM J. Computing, vol. 30, pp. 15791593, 2000.
[4] J. Cong, A.B. Kahng, and K.S. Leung, “Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem with Applications to VLSI Physical Design,” IEEE Trans. ComputerAided Design, vol. 17, pp. 2439, 1998.
[5] D.Z. Du and F.K. Hwang, “A Proof of GilbertPollak's Conjecture on the Steiner Ratio,” Algorithmica, vol. 7, pp. 121135, 1992.
[6] D.Z. Du and F.K. Hwang, “Reducing the Steiner Problem in a Normed Space,” SIAM J. Computing, vol. 21, pp. 10011007, 1992.
[7] M.R. Garey, R.L. Graham, and D.S. Johnson, “The Complexity of Computing Steiner Minimal Trees,” SIAM J. Applied Math., vol. 32, pp. 835859, 1977.
[8] E.N. Gilbert and H.O. Pollak, “Steiner Minimal Trees,” SIAM J. Applied Math., vol. 16, pp. 129, 1968.
[9] M. Hanan, “On Steiner's Problem with Rectilinear Distance,” SIAM J. Applied Math., vol. 14, pp. 255265, 1966.
[10] F.K. Hwang, D. Richard, and P. Winter, The Steiner Tree Problems. NorthHolland, 1992.
[11] F.K. Hwang and J.F. Weng, “The Shortest Network under a Given Topology,” J. Algorithms, vol. 13, pp. 468488, 1992.
[12] T. Jiang and L. Wang, “Computing Shortest Networks under a Fixed Topology,” Advances in Steiner Trees, D.Z. Du, J.M. Smith, and J.H. Rubinstein, eds., pp. 3962, Kluwer Academic, 2000.
[13] A.B. Kahng and G. Robins, On Optimal Interconnections for VLSI. Norwell, Mass.: Kluwer, 1995.
[14] N. Karmarkar,"A New PolynomialTime Algorithm for Linear Programming," Combinatorica, vol. 4, pp. 373395, 1984.
[15] D.T. Lee and C.F. Shen, “The Steiner Minimal Tree Problem in the$\big. \lambda{\hbox{}}{\rm Geometry}\bigr.$Plane,” Proc. Seventh Int'l Symp. Algorithms and Computations, pp. 247255, 1996.
[16] D.T. Lee, C.F. Shen, and C.L. Ding, “On Steiner Tree Problem with$\big. 45^o\bigr.$Routing,” Proc. IEEE Int'l Symp. Circuits and Systems, pp. 16801683, 1995.
[17] G.H. Lin and G.L. Xue, “The Steiner Tree Problem with 45Degree Routing,” Networks, vol. 35, pp. 287301, 2000.
[18] M.L. Overton, “A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms,” Math. Programming, vol. 27, pp. 3463, 1983.
[19] J.B. Rosen and G.L. Xue, “On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem,” Operations Research, vol. 41, pp. 11641171, 1993.
[20] M. Sarrafzadeh and C.K. Wong, “Hierarchical Steiner Tree Construction in Uniform Orientations,” IEEE Trans. ComputerAidedDesign, vol. 11, pp. 10951103, 1992.
[21] P. Widmayer, Y.F. Wu, and C.K. Wong, “On Some Distance Problems in Fixed Orientations,” SIAM J. Computing, vol. 16, pp. 728746, 1987.
[22] G.L. Xue, J.B. Rosen, and P.M. Pardalos, “A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem,” Operations Research Letters, vol. 18, pp. 201204, 1996.
[23] G.L. Xue and Y.Y. Ye, “An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications,” SIAM J. Optimization, vol. 7, pp. 10171036, 1997.
[24] G.L. Xue and Y.Y. Ye, “An Efficient Algorithm for Minimizing a Sum of pNorms,” SIAM J. Optimization, vol. 10, pp. 551579, 2000.
[25] G.L. Xue, G.L. Zhou, P.M. Pardalos, and L.Q. Qi, “Computing the Shortest Network with$\big. 45^{\circ}\bigr.$Routing under a Tree Topology with Applications,” Proc. 17th Int'l Symp. Math. Programming, Aug. 2000.
[26] G.Y. Yan, A. Alberecht, G.H.F. Young, and C.K. Wong, “The Steiner Tree Problem in Orientation Metrics,” J. Computer and System Sciences, vol. 55, pp. 529546, 1997.