arXiv:2606. 05046v1 Announce Type: new Abstract: We introduce Graph Cascades, a mesoscopic rewiring strategy for Graph Neural Networks (GNNs) and Graph Transformers (GTs) that captures intermediate-scale graph structure beyond purely local edges or fully global attention.
By Meher Chaitanya, My Le, Luana Ruiz
arXiv:2608. 12443v1 Announce Type: cross Abstract: Neural combinatorial optimization (NCO) relies on parallel solution sampling for training, yet existing methods fail to fully exploit the rich information latent in a co-sampled solution group.
By Yuanyu Li, Jintao Xu, Zijiang Liu, Yongzhi Qi, Ningxuan Kang, Jianshen Zhang, Wei Qi, Chen Xie, Zuo-Jun Max Shen
arXiv:2606. 01987v1 Announce Type: cross Abstract: We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem.
By Adel Dabah
arXiv:2606. 02136v1 Announce Type: new Abstract: Neural asymmetric routing models increasingly encode directionality through matrix representations and asymmetry-aware attention.
By Li Liang, Jinbiao Chen, Zizhen Zhang
arXiv:2603. 02462v2 Announce Type: replace-cross Abstract: A key challenge in developing unified neural solvers for combinatorial optimization (CO) is the efficient generalization of models from a given set of tasks to new tasks unseen during initial training.
By Semih Cant\"urk, Thomas Sabourin, Frederik Wenkel, Michael Perlmutter, Guy Wolf
arXiv:2607. 27479v1 Announce Type: new Abstract: The information flow in the graph neural networks (GNNs) is fundamentally constrained by over-squashing, where structural bottlenecks impede long range information propagation.
By Aryan Mishra, Randy Martinez, Lizhen Lin