{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:00Z","timestamp":1725573420167},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_104","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"1051-1060","source":"Crossref","is-referenced-by-count":4,"title":["On Routing in VLSI Design and Communication Networks"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Terlaky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"104_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/S1052623497318013","volume":"9","author":"K.M. Anstreicher","year":"1999","unstructured":"Anstreicher, K.M.: Towards a practical volumetric cutting plane method for convex programming. SIAM Journal on Optimization\u00a09, 190\u2013206 (1999)","journal-title":"SIAM Journal on Optimization"},{"key":"104_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1051\/ro:2004028","volume":"38","author":"A. Baltz","year":"2004","unstructured":"Baltz, A., Srivastav, A.: Fast approximation of minimum multicast congestion - implementation versus theory. RAIRO Operations Research\u00a038, 319\u2013344 (2004)","journal-title":"RAIRO Operations Research"},{"key":"104_CR3","unstructured":"Behjat, L.: New modeling and optimization techniques for the global routing problem. Ph.D. Thesis, University of Waterloo (2002)"},{"key":"104_CR4","unstructured":"Behjat, L., Vannelli, A., Rosehart, W.: Linear programming models for the global routing problem. To appear in Informs Journal on Computing (2004)"},{"key":"104_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Professing Letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Professing Letters"},{"key":"104_CR6","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00453-003-1054-1","volume":"38","author":"M. Cai","year":"2004","unstructured":"Cai, M., Deng, X., Wang, L.: Minimum k arborescences with bandwidth constraints. Algorithmica\u00a038, 529\u2013537 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"104_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/90.851977","volume":"8","author":"S. Chen","year":"2000","unstructured":"Chen, S., G\u00fcnl\u00fck, O., Yener, B.: The multicast packing problem. IEEE\/ACM Transactions on Networking\u00a08(3), 311\u2013318 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"104_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research\u00a02, 321\u2013340 (1996)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"104_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing\u00a04(3), 221\u2013225 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"104_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings of TCS 2002, pp. 255\u2013266 (2002)","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"104_CR11","unstructured":"Jansen, K., Zhang, H.: An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In: Proceedings of ARACNE 2002, pp. 77\u201390 (2002)"},{"key":"104_CR12","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","volume":"20","author":"X. Jia","year":"1997","unstructured":"Jia, X., Wang, L.: A group multicast routing algorithm by using multiple minimum Steiner trees. Computer Communications\u00a020, 750\u2013758 (1997)","journal-title":"Computer Communications"},{"key":"104_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","volume":"10","author":"C.Y. Lee","year":"1961","unstructured":"Lee, C.Y.: An algorithm for path connection and its application. IRE Transactions on Electronic Computers\u00a010, 346\u2013365 (1961)","journal-title":"IRE Transactions on Electronic Computers"},{"key":"104_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial algorithms for integrated circuit layout. J. Wiley, New York (1990)"},{"issue":"1","key":"104_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623497331786","volume":"11","author":"T. Lengauer","year":"2000","unstructured":"Lengauer, T., Lungering, M.: Provably good global routing of integrated circuits. SIAM Journal on Optimization\u00a011(1), 1\u201330 (2000)","journal-title":"SIAM Journal on Optimization"},{"key":"104_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences\u00a037, 130\u2013143 (1988)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"104_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"104_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/11600930_69","volume-title":"Internet and Network Economics","author":"M. Saad","year":"2005","unstructured":"Saad, M., Terlaky, T., Vannelli, A., Zhang, H.: Packing trees in communication networks. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 688\u2013697. Springer, Heidelberg (2005)"},{"key":"104_CR19","doi-asserted-by":"crossref","unstructured":"Terlaky, T., Vannelli, A., Zhang, H.: On routing in VLSI design and communication networks. Technical Report, AdvOL #2005-14, Advanced Optimization Lab., McMaster University, http:\/\/www.cas.mcmaster.ca\/~oplab\/research.htm","DOI":"10.1007\/11602613_104"},{"issue":"2","key":"104_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/43.68406","volume":"10","author":"A. Vannelli","year":"1991","unstructured":"Vannelli, A.: An adaptation of the interior point method for solving the global routing problem. IEEE Transactions on Computer-Aided Design\u00a010(2), 193\u2013203 (1991)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"104_CR21","series-title":"Lecture Notes in Economics and Mathematical Systems 450","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume-title":"Network Optimization","author":"J. Villavicencio","year":"1997","unstructured":"Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. Lecture Notes in Economics and Mathematical Systems 450, pp. 471\u2013485. Springer, Heidelberg (1997)"},{"key":"104_CR22","unstructured":"Zhang, H.: Approximation algorithms for min-max resource sharing and malleable tasks scheduling. Ph.D. Thesis, University of Kiel (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T18:23:19Z","timestamp":1683310999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11602613_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}