{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T01:40:00Z","timestamp":1770774000265,"version":"3.50.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,27]]},"DOI":"10.1145\/3676536.3676683","type":"proceedings-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:26:26Z","timestamp":1744205186000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["GAT-Steiner: Rectilinear Steiner Minimal Tree Prediction Using GNNs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7188-7839","authenticated-orcid":false,"given":"Bugra","family":"Onal","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, University of California Santa Cruz, Santa Cruz, California, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0718-3593","authenticated-orcid":false,"given":"Eren","family":"Dogan","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of California Santa Cruz, Santa Cruz, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8136-9410","authenticated-orcid":false,"given":"Muhammad Hadir","family":"Khan","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of California Santa Cruz, Santa Cruz, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8113-4531","authenticated-orcid":false,"given":"Matthew R.","family":"Guthaus","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of California Santa Cruz, Santa Cruz, California, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-018-0135-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"e_1_3_2_1_3_1","first-page":"569","volume-title":"Provably good routing topology by a novel steiner shallow-light tree algorithm,\" in 2017 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","author":"Chen G.","year":"2017","unstructured":"G. Chen, P. Tu, and E. F. Y. Young, \"SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm,\" in 2017 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 569--576, 2017."},{"key":"e_1_3_2_1_4_1","volume-title":"A mixed neural-algorithmic approach for the rectilinear steiner minimum tree problem,\" arXiv:2312.10589","author":"Kahng A. B.","year":"2023","unstructured":"A. B. Kahng, R. R. Nerem, Y. Wang, and C.-Y. Yang, \"NN-Steiner: A mixed neural-algorithmic approach for the rectilinear steiner minimum tree problem,\" arXiv:2312.10589, 2023."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_6_1","volume-title":"a deep reinforcement learning approach,\" Master's thesis","author":"Wang S.","year":"2021","unstructured":"S. Wang, \"Steiner Tree: a deep reinforcement learning approach,\" Master's thesis, University of Delaware, 2021."},{"key":"e_1_3_2_1_7_1","volume-title":"Graph Attention Networks,\" arXiv:1710.10903","author":"Veli\u010dkovi\u0107 P.","year":"2018","unstructured":"P. Veli\u010dkovi\u0107, G. Cucurull, A. Casanova, A. Romero, P. Li\u00f2, and Y. Bengio, \"Graph Attention Networks,\" arXiv:1710.10903, 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Semi-supervised classification with graph convolutional networks,\" arXiv:1609.02907","author":"Kipf T. N.","year":"2017","unstructured":"T. N. Kipf and M. Welling, \"Semi-supervised classification with graph convolutional networks,\" arXiv:1609.02907, 2017."},{"key":"e_1_3_2_1_9_1","volume-title":"Inductive representation learning on large graphs,\" arXiv:1706.02216","author":"Hamilton W. L.","year":"2018","unstructured":"W. L. Hamilton, R. Ying, and J. Leskovec, \"Inductive representation learning on large graphs,\" arXiv:1706.02216, 2018."},{"key":"e_1_3_2_1_10_1","volume-title":"A survey on oversmoothing in graph neural networks,\" arXiv:2303.10993","author":"Rusch T. K.","year":"2023","unstructured":"T. K. Rusch, M. M. Bronstein, and S. Mishra, \"A survey on oversmoothing in graph neural networks,\" arXiv:2303.10993, 2023."},{"key":"e_1_3_2_1_11_1","volume-title":"ichi Kawarabayashi, and S. Jegelka, \"Representation learning on graphs with jumping knowledge networks,\" arXiv:1806.03536","author":"Xu K.","year":"2018","unstructured":"K. Xu, C. Li, Y. Tian, T. Sonobe, K. ichi Kawarabayashi, and S. Jegelka, \"Representation learning on graphs with jumping knowledge networks,\" arXiv:1806.03536, 2018."},{"key":"e_1_3_2_1_12_1","volume-title":"Attention is all you need,\" arXiv:1706.03762","author":"Vaswani A.","year":"2023","unstructured":"A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, \"Attention is all you need,\" arXiv:1706.03762, 2023."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_2_1_14_1","volume-title":"Focal loss for dense object detection,\" arXiv:1708.02002","author":"Lin T.-Y.","year":"2018","unstructured":"T.-Y. Lin, P. Goyal, R. Girshick, K. He, and P. Doll\u00e1r, \"Focal loss for dense object detection,\" arXiv:1708.02002, 2018."},{"key":"e_1_3_2_1_15_1","volume-title":"KerasTuner","author":"O'Malley T.","year":"2019","unstructured":"T. O'Malley, E. Bursztein, J. Long, F. Chollet, H. Jin, L. Invernizzi, et al., \"KerasTuner,\" 2019."},{"key":"e_1_3_2_1_16_1","volume-title":"Hyperband: A novel bandit-based approach to hyperparameter optimization,\" arXiv:1603.06560","author":"Li L.","year":"2018","unstructured":"L. Li, K. Jamieson, G. DeSalvo, A. Rostamizadeh, and A. Talwalkar, \"Hyperband: A novel bandit-based approach to hyperparameter optimization,\" arXiv:1603.06560, 2018."},{"key":"e_1_3_2_1_17_1","volume-title":"TensorFlow: Large-scale machine learning on heterogeneous systems","author":"Abadi M.","year":"2015","unstructured":"M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, S. Ghemawat, I. Goodfellow, A. Harp, G. Irving, M. Isard, Y. Jia, R. Jozefowicz, L. Kaiser, M. Kudlur, J. Levenberg, D. Man\u00e9, R. Monga, S. Moore, D. Murray, C. Olah, M. Schuster, J. Shlens, B. Steiner, I. Sutskever, K. Talwar, P. Tucker, V. Vanhoucke, V. Vasudevan, F. Vi\u00e9gas, O. Vinyals, P. Warden, M. Wattenberg, M. Wicke, Y. Yu, and X. Zheng, \"TensorFlow: Large-scale machine learning on heterogeneous systems,\" 2015. Software available from tensorflow.org."},{"key":"e_1_3_2_1_18_1","volume-title":"Graph Neural Networks in TensorFlow and Keras with Spektral,\" arXiv:2006.12138","author":"Grattarola D.","year":"2020","unstructured":"D. Grattarola and C. Alippi, \"Graph Neural Networks in TensorFlow and Keras with Spektral,\" arXiv:2006.12138, 2020."},{"key":"e_1_3_2_1_19_1","unstructured":"IBM \"ILOG CPLEX Optimization Studio \" 2024. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio."},{"key":"e_1_3_2_1_20_1","first-page":"147","volume-title":"ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules,\" in International Symposium on Physical Design (ISPD)","author":"Liu W.-H.","year":"2019","unstructured":"W.-H. Liu, S. Mantik, W.-K. Chow, Y. Ding, A. Farshidi, and G. Posser, \"ISPD 2019 initial detailed routing contest and benchmark with advanced routing rules,\" in International Symposium on Physical Design (ISPD), p. 147--151, 2019."}],"event":{"name":"ICCAD '24: 43rd IEEE\/ACM International Conference on Computer-Aided Design","location":"Newark Liberty International Airport Marriott New York NY USA","acronym":"ICCAD '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE EDS"]},"container-title":["Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3676683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3676536.3676683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:57Z","timestamp":1750290237000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3676683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":20,"alternative-id":["10.1145\/3676536.3676683","10.1145\/3676536"],"URL":"https:\/\/doi.org\/10.1145\/3676536.3676683","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]},"assertion":[{"value":"2025-04-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}