{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:01:34Z","timestamp":1773864094519,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ational Key Research and Development Program of China","award":["2020AAA0107600"],"award-info":[{"award-number":["2020AAA0107600"]}]},{"name":"Starry Night Science Fund at Shanghai Institute for Advanced Study (Zhejiang University)"},{"name":"NSFC","award":["62222607, U19B2035"],"award-info":[{"award-number":["62222607, U19B2035"]}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2021SHZDZX0102"],"award-info":[{"award-number":["2021SHZDZX0102"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599358","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"531-543","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["GAL-VNE: Solving the VNE Problem with Global Reinforcement Learning and Local One-Shot Neural Prediction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7808-3959","authenticated-orcid":false,"given":"Haoyu","family":"Geng","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9566-738X","authenticated-orcid":false,"given":"Runzhong","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2139-8807","authenticated-orcid":false,"given":"Fei","family":"Wu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.136"},{"key":"e_1_3_2_2_2_1","volume-title":"Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940","author":"Bello Irwan","year":"2016","unstructured":"Irwan Bello , Hieu Pham , Quoc V Le , Mohammad Norouzi , and Samy Bengio . 2016. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 ( 2016 ). Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. 2016. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_2_4_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal","volume":"5","author":"Birkhoff Garrett","year":"1946","unstructured":"Garrett Birkhoff . 1946 . Tres observaciones sobre el algebra lineal . Univ. Nac. Tucuman, Ser. A , Vol. 5 (1946), 147 -- 154 . Garrett Birkhoff. 1946. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A, Vol. 5 (1946), 147--154.","journal-title":"Univ. Nac. Tucuman, Ser. A"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486263"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.030912.120082"},{"key":"e_1_3_2_2_7_1","volume-title":"The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012","author":"Bresson Xavier","year":"2021","unstructured":"Xavier Bresson and Thomas Laurent . 2021. The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012 ( 2021 ). Xavier Bresson and Thomas Laurent. 2021. The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012 (2021)."},{"key":"e_1_3_2_2_8_1","volume-title":"A note on over-smoothing for graph neural networks. arXiv preprint arXiv:2006.13318","author":"Cai Chen","year":"2020","unstructured":"Chen Cai and Yusu Wang . 2020. A note on over-smoothing for graph neural networks. arXiv preprint arXiv:2006.13318 ( 2020 ). Chen Cai and Yusu Wang. 2020. A note on over-smoothing for graph neural networks. arXiv preprint arXiv:2006.13318 (2020)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.23919\/JCC.2019.12.001"},{"key":"e_1_3_2_2_10_1","unstructured":"R. Chen X. Lv Y. Li J. Ye J. Hao and J. Yan. 2022. The Policy-gradient Placement and Generative Routing Neural Networks for Chip Design. In Neural Information Processing Systems (NeurIPS).  R. Chen X. Lv Y. Li J. Ye J. Hao and J. Yan. 2022. The Policy-gradient Placement and Generative Routing Neural Networks for Chip Design. In Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"e_1_3_2_2_12_1","volume-title":"Muntasir Raihan Rahman, and Raouf Boutaba","author":"Chowdhury Mosharaf","year":"2011","unstructured":"Mosharaf Chowdhury , Muntasir Raihan Rahman, and Raouf Boutaba . 2011 . Vineyard : Virtual network embedding algorithms with coordinated node and link mapping. IEEE\/ACM Transactions on networking, Vol. 20 , 1 (2011), 206--219. Mosharaf Chowdhury, Muntasir Raihan Rahman, and Raouf Boutaba. 2011. Vineyard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE\/ACM Transactions on networking, Vol. 20, 1 (2011), 206--219."},{"key":"e_1_3_2_2_13_1","volume-title":"Neural Information Processing Systems (NeurIPS)","volume":"32","author":"Cuturi Marco","year":"2019","unstructured":"Marco Cuturi , Olivier Teboul , and Jean-Philippe Vert . 2019 . Differentiable ranking and sorting using optimal transport . Neural Information Processing Systems (NeurIPS) , Vol. 32 (2019). Marco Cuturi, Olivier Teboul, and Jean-Philippe Vert. 2019. Differentiable ranking and sorting using optimal transport. Neural Information Processing Systems (NeurIPS), Vol. 32 (2019)."},{"key":"e_1_3_2_2_14_1","volume-title":"A multi-task selected learning approach for solving 3d flexible bin packing problem. arXiv preprint arXiv:1804.06896","author":"Duan Lu","year":"2018","unstructured":"Lu Duan , Haoyuan Hu , Yu Qian , Yu Gong , Xiaodong Zhang , Yinghui Xu , and Jiangwen Wei . 2018. A multi-task selected learning approach for solving 3d flexible bin packing problem. arXiv preprint arXiv:1804.06896 ( 2018 ). Lu Duan, Haoyuan Hu, Yu Qian, Yu Gong, Xiaodong Zhang, Yinghui Xu, and Jiangwen Wei. 2018. A multi-task selected learning approach for solving 3d flexible bin packing problem. arXiv preprint arXiv:1804.06896 (2018)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Ilhem Fajjari Nadjib Aitsaadi Guy Pujolle and Hubert Zimmermann. 2011. VNE-AC: Virtual network embedding algorithm based on ant colony metaheuristic. In ICC.  Ilhem Fajjari Nadjib Aitsaadi Guy Pujolle and Hubert Zimmermann. 2011. VNE-AC: Virtual network embedding algorithm based on ant colony metaheuristic. In ICC.","DOI":"10.1109\/icc.2011.5963442"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198265"},{"key":"e_1_3_2_2_17_1","volume-title":"Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.","author":"Fey Matthias","unstructured":"Matthias Fey and Jan E. Lenssen . 2019 . Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds. Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Long Gong Yonggang Wen Zuqing Zhu and Tony Lee. 2014. Toward profit-seeking virtual network embedding algorithm via global resource capacity. In INFOCOM. 1--9.  Long Gong Yonggang Wen Zuqing Zhu and Tony Lee. 2014. Toward profit-seeking virtual network embedding algorithm via global resource capacity. In INFOCOM. 1--9.","DOI":"10.1109\/INFOCOM.2014.6847918"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM50824.2020.9269128"},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques. 112--117","author":"Haeri Soroush","year":"2016","unstructured":"Soroush Haeri and Ljiljana Trajkovi\u0107 . 2016 . VNE-Sim: a virtual network embedding simulator . In Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques. 112--117 . Soroush Haeri and Ljiljana Trajkovi\u0107. 2016. VNE-Sim: a virtual network embedding simulator. In Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques. 112--117."},{"key":"e_1_3_2_2_21_1","volume-title":"Virtual network embedding via Monte Carlo tree search","author":"Haeri Soroush","year":"2017","unstructured":"Soroush Haeri and Ljiljana Trajkovi\u0107 . 2017. Virtual network embedding via Monte Carlo tree search . IEEE transactions on cybernetics, Vol. 48 , 2 ( 2017 ), 510--521. Soroush Haeri and Ljiljana Trajkovi\u0107. 2017. Virtual network embedding via Monte Carlo tree search. IEEE transactions on cybernetics, Vol. 48, 2 (2017), 510--521."},{"key":"e_1_3_2_2_23_1","unstructured":"William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Neural Information Processing Systems (NIPS). 1025--1035.  William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Neural Information Processing Systems (NIPS). 1025--1035."},{"key":"e_1_3_2_2_24_1","volume-title":"2008 International Conference on Machine Learning and Cybernetics","volume":"3","author":"He Chuan","year":"2008","unstructured":"Chuan He , Cong Wang , Yi-Xin Zhong , and Rui-Fan Li . 2008 . A survey on learning to rank . In 2008 International Conference on Machine Learning and Cybernetics , Vol. 3 . Ieee, 1734--1739. Chuan He, Cong Wang, Yi-Xin Zhong, and Rui-Fan Li. 2008. A survey on learning to rank. In 2008 International Conference on Machine Learning and Cybernetics, Vol. 3. Ieee, 1734--1739."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.12.011"},{"key":"e_1_3_2_2_26_1","volume-title":"Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930","author":"Hu Haoyuan","year":"2017","unstructured":"Haoyuan Hu , Xiaodong Zhang , Xiaowei Yan , Longfei Wang , and Yinghui Xu. 2017. Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 ( 2017 ). Haoyuan Hu, Xiaodong Zhang, Xiaowei Yan, Longfei Wang, and Yinghui Xu. 2017. Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 (2017)."},{"key":"e_1_3_2_2_27_1","volume-title":"Categorical Reparametrization with Gumble-Softmax. In International Conference on Learning Representations (ICLR","author":"Jang Eric","year":"2017","unstructured":"Eric Jang , Shixiang Gu , and Ben Poole . 2017 . Categorical Reparametrization with Gumble-Softmax. In International Conference on Learning Representations (ICLR 2017). OpenReview. net. Eric Jang, Shixiang Gu, and Ben Poole. 2017. Categorical Reparametrization with Gumble-Softmax. In International Conference on Learning Representations (ICLR 2017). OpenReview. net."},{"key":"e_1_3_2_2_28_1","unstructured":"Elias Khalil Hanjun Dai Yuyu Zhang Bistra Dilkina and Le Song. 2017. Learning combinatorial optimization algorithms over graphs. In Neural Information Processing Systems (NeurIPS). 6351--6361.  Elias Khalil Hanjun Dai Yuyu Zhang Bistra Dilkina and Le Song. 2017. Learning combinatorial optimization algorithms over graphs. In Neural Information Processing Systems (NeurIPS). 6351--6361."},{"key":"e_1_3_2_2_29_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016 . Semi-supervised classification with graph convolutional networks . In International Conference on Learning Representations (ICLR). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_30_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Kool Wouter","year":"2019","unstructured":"Wouter Kool , Herke van Hoof , and Max Welling . 2019 . Attention, Learn to Solve Routing Problems! . In International Conference on Learning Representations (ICLR). Wouter Kool, Herke van Hoof, and Max Welling. 2019. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab040"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD).","author":"Li Yang","year":"2023","unstructured":"Yang Li , Xinyan Chen , Wenxuan Guo , Xijun Li , Wanqian Luo , Junhua Huang , Hui-Ling Zhen , Mingxuan Yuan , and Junchi Yan . 2023 . HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline . In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD). Yang Li, Xinyan Chen, Wenxuan Guo, Xijun Li, Wanqian Luo, Junhua Huang, Hui-Ling Zhen, Mingxuan Yuan, and Junchi Yan. 2023. HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline. In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592648.1592662"},{"key":"e_1_3_2_2_34_1","volume-title":"Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching. In International Conference on Learning Representations (ICLR).","author":"Liu C.","unstructured":"C. Liu , Z. Jiang , R. Wang , L. Huang , P. Lu , and J. Yan . 2023 . Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching. In International Conference on Learning Representations (ICLR). C. Liu, Z. Jiang, R. Wang, L. Huang, P. Lu, and J. Yan. 2023. Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_35_1","volume-title":"ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs. In International Conference on Learning Representations (ICLR).","author":"Lu Han","year":"2023","unstructured":"Han Lu , Zenan Li , Runzhong Wang , Qibing Ren , Xijun Li , Mingxuan Yuan , Jia Zeng , Xiaokang Yang , and Junchi Yan . 2023 . ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs. In International Conference on Learning Representations (ICLR). Han Lu, Zenan Li, Runzhong Wang, Qibing Ren, Xijun Li, Mingxuan Yuan, Jia Zeng, Xiaokang Yang, and Junchi Yan. 2023. ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_36_1","volume-title":"Neural Information Processing Systems (NeurIPS)","volume":"32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke , Sam Gross , Francisco Massa , Adam Lerer , James Bradbury , Gregory Chanan , Trevor Killeen , Zeming Lin , Natalia Gimelshein , Luca Antiga , 2019 . Pytorch: An imperative style, high-performance deep learning library . Neural Information Processing Systems (NeurIPS) , Vol. 32 (2019). Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. Neural Information Processing Systems (NeurIPS), Vol. 32 (2019)."},{"key":"e_1_3_2_2_37_1","unstructured":"Laurent Perron and Vincent Furnon. 2022-11-25. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/  Laurent Perron and Vincent Furnon. 2022-11-25. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_3_2_2_39_1","volume-title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","author":"Rol\u00ednek Michal","unstructured":"Michal Rol\u00ednek , Paul Swoboda , Dominik Zietlow , Anselm Paulus , V\u00edt Musil , and Georg Martius . 2020. Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers . In ECCV. Springer , 407--424. Michal Rol\u00ednek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, V\u00edt Musil, and Georg Martius. 2020. Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. In ECCV. Springer, 407--424."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2975646"},{"key":"e_1_3_2_2_41_1","volume-title":"Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman , Filip Wolski , Prafulla Dhariwal , Alec Radford , and Oleg Klimov . 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 ( 2017 ). John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_2_42_1","volume-title":"A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics","author":"Sinkhorn Richard","year":"1964","unstructured":"Richard Sinkhorn . 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics , Vol. 35 , 2 ( 1964 ), 876--879. Richard Sinkhorn. 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics, Vol. 35, 2 (1964), 876--879."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2286156"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577741"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Ihsan Ullah Hyun-Kyo Lim and Youn-Hee Han. 2021. Ego Network-based Virtual Network Embedding Scheme for Revenue Maximization. In ICAIIC. 155--160.  Ihsan Ullah Hyun-Kyo Lim and Youn-Hee Han. 2021. Ego Network-based Virtual Network Embedding Scheme for Revenue Maximization. In ICAIIC. 155--160.","DOI":"10.1109\/ICAIIC51459.2021.9415185"},{"key":"e_1_3_2_2_46_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Neural Information Processing Systems (NIPS).  Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Neural Information Processing Systems (NIPS)."},{"key":"e_1_3_2_2_47_1","volume-title":"Neural Information Processing Systems (NIPS)","volume":"28","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals , Meire Fortunato , and Navdeep Jaitly . 2015 . Pointer networks . Neural Information Processing Systems (NIPS) , Vol. 28 (2015). Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. Neural Information Processing Systems (NIPS), Vol. 28 (2015)."},{"key":"e_1_3_2_2_48_1","volume-title":"Towards One-shot Neural Combinatorial Optimization Solvers: Theoretical and Empirical Notes on the Cardinality-Constrained Case. In International Conference on Learning Representations (ICLR).","author":"Wang R.","unstructured":"R. Wang , L. Shen , Y. Chen , X. Yang , D. Tao , and J. Yan . 2023 . Towards One-shot Neural Combinatorial Optimization Solvers: Theoretical and Empirical Notes on the Cardinality-Constrained Case. In International Conference on Learning Representations (ICLR). R. Wang, L. Shen, Y. Chen, X. Yang, D. Tao, and J. Yan. 2023. Towards One-shot Neural Combinatorial Optimization Solvers: Theoretical and Empirical Notes on the Cardinality-Constrained Case. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_49_1","volume-title":"Combinatorial learning of robust deep graph matching: an embedding based approach","author":"Wang Runzhong","year":"2020","unstructured":"Runzhong Wang , Junchi Yan , and Xiaokang Yang . 2020. Combinatorial learning of robust deep graph matching: an embedding based approach . IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) ( 2020 ). Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2020. Combinatorial learning of robust deep graph matching: an embedding based approach. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) (2020)."},{"key":"e_1_3_2_2_50_1","volume-title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","author":"Wang Runzhong","year":"2021","unstructured":"Runzhong Wang , Junchi Yan , and Xiaokang Yang . 2021b. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching . IEEE transactions on pattern analysis and machine intelligence (TPAMI) ( 2021 ). Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2021b. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching. IEEE transactions on pattern analysis and machine intelligence (TPAMI) (2021)."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500964"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00133"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_3_2_2_54_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).","author":"Yan J.","unstructured":"J. Yan , S. Yang , and E. Hancock . 2020b. Learning Graph Matching and Related Combinatorial Optimization Problems . In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). J. Yan, S. Yang, and E. Hancock. 2020b. Learning Graph Matching and Related Combinatorial Optimization Problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2986662"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.01.025"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2971543"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"e_1_3_2_2_59_1","volume-title":"A survey for solving mixed integer programming via machine learning. Neurocomputing","author":"Zhang Jiayi","year":"2023","unstructured":"Jiayi Zhang , Chang Liu , Xijun Li , Hui-Ling Zhen , Mingxuan Yuan , Yawen Li , and Junchi Yan . 2023. A survey for solving mixed integer programming via machine learning. Neurocomputing ( 2023 ). Jiayi Zhang, Chang Liu, Xijun Li, Hui-Ling Zhen, Mingxuan Yuan, Yawen Li, and Junchi Yan. 2023. A survey for solving mixed integer programming via machine learning. Neurocomputing (2023)."},{"key":"e_1_3_2_2_60_1","volume-title":"Resource management and security scheme of ICPSs and IoT based on VNE algorithm","author":"Zhang Peiying","year":"2021","unstructured":"Peiying Zhang , Chao Wang , Chunxiao Jiang , Neeraj Kumar , and Qinghua Lu. 2021. Resource management and security scheme of ICPSs and IoT based on VNE algorithm . IEEE Internet of Things Journal ( 2021 ). Peiying Zhang, Chao Wang, Chunxiao Jiang, Neeraj Kumar, and Qinghua Lu. 2021. Resource management and security scheme of ICPSs and IoT based on VNE algorithm. IEEE Internet of Things Journal (2021)."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3095094"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2726120"},{"key":"e_1_3_2_2_63_1","volume-title":"FELL: A Flexible Virtual Network Embedding Algorithm with Guaranteed Load Balancing. In 2011 IEEE International Conference on Communications (ICC). 1--5. https:\/\/doi.org\/10","author":"Zhang Sheng","year":"2011","unstructured":"Sheng Zhang , Zhuzhong Qian , Song Guo , and Sanglu Lu . 2011 . FELL: A Flexible Virtual Network Embedding Algorithm with Guaranteed Load Balancing. In 2011 IEEE International Conference on Communications (ICC). 1--5. https:\/\/doi.org\/10 .1109\/icc.2011.5962960 10.1109\/icc.2011.5962960 Sheng Zhang, Zhuzhong Qian, Song Guo, and Sanglu Lu. 2011. FELL: A Flexible Virtual Network Embedding Algorithm with Guaranteed Load Balancing. In 2011 IEEE International Conference on Communications (ICC). 1--5. https:\/\/doi.org\/10.1109\/icc.2011.5962960"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1399"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2895354"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599358","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":65,"alternative-id":["10.1145\/3580305.3599358","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599358","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}