{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:10Z","timestamp":1742914090880,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030600280"},{"type":"electronic","value":"9783030600297"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60029-7_12","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T23:07:40Z","timestamp":1600729660000},"page":"131-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SLPSO-Based X-Architecture Steiner Minimum Tree Construction"],"prefix":"10.1007","author":[{"given":"Xiaohua","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruping","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genggeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"26266","DOI":"10.1109\/ACCESS.2020.2971574","volume":"8","author":"X Chen","year":"2020","unstructured":"Chen, X., Liu, G., Xiong, N., Su, Y., Chen, G.: A survey of swarm intelligence techniques in VLSI routing problems. IEEE Access 8, 26266\u201326292 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2971574","journal-title":"IEEE Access"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Coulston, C.S.: Constructing exact octagonal Steiner minimal trees. In: Proceedings of the 13th ACM Great Lakes symposium on VLSI, pp. 1\u20136 (2003). https:\/\/doi.org\/10.1145\/764808.764810","DOI":"10.1145\/764808.764810"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/S11704-014-3008-Y","volume":"8","author":"W Guo","year":"2014","unstructured":"Guo, W., Liu, G., Chen, G., Peng, S.: A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning. Front. Comput. Sci. China 8(2), 203\u2013216 (2014). https:\/\/doi.org\/10.1007\/S11704-014-3008-Y","journal-title":"Front. Comput. Sci. China"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2856033","volume":"21","author":"X Huang","year":"2016","unstructured":"Huang, X., Guo, W., Liu, G., Chen, G.: FH-OAOS: a fast four-step heuristic for obstacle-avoiding octilinear Steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. 21(3), 1\u201331 (2016). https:\/\/doi.org\/10.1145\/2856033","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699862","volume":"20","author":"X Huang","year":"2015","unstructured":"Huang, X., Liu, G., Guo, W., Niu, Y., Chen, G.: Obstacle-avoiding algorithm in x-architecture based on discrete particle swarm optimization for VLSI design. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 20(2), 1\u201328 (2015). https:\/\/doi.org\/10.1145\/2699862","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3177878","volume":"23","author":"KW Lin","year":"2018","unstructured":"Lin, K.W., Lin, Y.S., Li, Y.L., Lin, R.B.: A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 23(4), 1\u201326 (2018). https:\/\/doi.org\/10.1145\/3177878","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Lin, S.E.D., Kim, D.H.: Construction of all rectilinear Steiner minimum trees on the hanan grid. In: Proceedings of the 2018 International Symposium on Physical Design, pp. 18\u201325 (2018). https:\/\/doi.org\/10.1145\/3177540.3178240","DOI":"10.1145\/3177540.3178240"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Liu, G., Chen, G., Guo, W.: DPSO based octagonal Steiner tree algorithm for VLSI routing. In: 2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI), pp. 383\u2013387. IEEE (2012). https:\/\/doi.org\/10.1109\/ICACI.2012.6463191","DOI":"10.1109\/ICACI.2012.6463191"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Liu, G., Chen, G., Guo, W., Chen, Z.: DPSO-based rectilinear Steiner minimal tree construction considering bend reduction. In: 2011 Seventh International Conference on Natural Computation, vol. 2, pp. 1161\u20131165. IEEE (2011). https:\/\/doi.org\/10.1109\/ICNC.2011.6022221","DOI":"10.1109\/ICNC.2011.6022221"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Liu, G., Chen, Z., Guo, W., Chen, G.: Self-adapting PSO algorithm with efficient hybrid transformation strategy for x-architecture Steiner minimal tree construction algorithm. Pattern Recogn. Artif. Intell. 31(5), 398\u2013408 (2018). https:\/\/doi.org\/10.16451\/j.cnki.issn1003-6059.201805002. (In Chinese)","DOI":"10.16451\/j.cnki.issn1003-6059.201805002"},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"3943","DOI":"10.1007\/S00500-019-04165-2","volume":"24","author":"G Liu","year":"2020","unstructured":"Liu, G., Chen, Z., Zhuang, Z., Guo, W., Chen, G.: A unified algorithm based on HTS and self-adapting PSO for the construction of octagonal and rectilinear SMT. Soft Comput. 24(6), 3943\u20133961 (2020). https:\/\/doi.org\/10.1007\/S00500-019-04165-2","journal-title":"Soft Comput."},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/S11704-015-4017-1","volume":"9","author":"G Liu","year":"2015","unstructured":"Liu, G., Guo, W., Li, R., Niu, Y., Chen, G.: Xgrouter: high-quality global router in x-architecture with particle swarm optimization. Front. Comput. Sci. China 9(4), 576\u2013594 (2015). https:\/\/doi.org\/10.1007\/S11704-015-4017-1","journal-title":"Front. Comput. Sci. China"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/S00500-014-1329-2","volume":"19","author":"G Liu","year":"2015","unstructured":"Liu, G., Guo, W., Niu, Y., Chen, G., Huang, X.: A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction. Soft Comput. 19(5), 1153\u20131169 (2015). https:\/\/doi.org\/10.1007\/S00500-014-1329-2","journal-title":"Soft Comput."},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Thurber, A., Xue, G.: Computing hexagonal Steiner trees using PCX [for VLSI]. In: Proceedings of ICECS 1999, 6th IEEE International Conference on Electronics, Circuits and Systems, ICECS 1999 (Cat. No. 99EX357), vol. 1, pp. 381\u2013384. IEEE (1999). https:\/\/doi.org\/10.1109\/ICECS.1999.812302","DOI":"10.1109\/ICECS.1999.812302"},{"key":"12_CR15","unstructured":"Warme, D., Winter, P., Zachariasen, M.: Geosteiner software for computing Steiner trees (2003). http:\/\/geosteiner.net"},{"key":"12_CR16","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-030-32456-8_47","volume-title":"Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery","author":"H Wu","year":"2020","unstructured":"Wu, H., Xu, S., Zhuang, Z., Liu, G.: X-architecture Steiner minimal tree construction based on discrete differential evolution. In: Liu, Y., Wang, L., Zhao, L., Yu, Z. (eds.) ICNC-FSKD 2019. AISC, vol. 1074, pp. 433\u2013442. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-32456-8_47"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1344418.1344422","volume":"13","author":"JT Yan","year":"2008","unstructured":"Yan, J.T.: Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 13(2), 1\u201318 (2008). https:\/\/doi.org\/10.1145\/1344418.1344422","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/J.INS.2018.12.030","volume":"480","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Wang, X., Kang, Q., Cheng, J.: Differential mutation and novel social learning particle swarm optimization algorithm. Inf. Sci. 480, 109\u2013129 (2019). https:\/\/doi.org\/10.1016\/J.INS.2018.12.030","journal-title":"Inf. Sci."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-02934-0_1","volume-title":"Web Information Systems and Applications","author":"H Zhao","year":"2018","unstructured":"Zhao, H., Xia, S., Zhao, J., Zhu, D., Yao, R., Niu, Q.: Pareto-based many-objective convolutional neural networks. In: Meng, X., Li, R., Wang, K., Niu, B., Wang, X., Zhao, G. (eds.) WISA 2018. LNCS, vol. 11242, pp. 3\u201314. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02934-0_1"},{"issue":"7","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/TCAD.2005.850862","volume":"24","author":"Q Zhu","year":"2005","unstructured":"Zhu, Q., Zhou, H., Jing, T., Hong, X.L., Yang, Y.: Spanning graph-based nonrectilinear Steiner tree algorithms. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 24(7), 1066\u20131075 (2005). https:\/\/doi.org\/10.1109\/TCAD.2005.850862","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60029-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:40:29Z","timestamp":1709811629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60029-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600280","9783030600297"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60029-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wisa.pmease.cn\/wisa2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CCF Consys","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"165","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}