GATNextHop: a GAT for shortest path routing with cross-topology generalization
Read the original at arxiv.org→arXiv:2608.23917v1 Announce Type: new Abstract: Common shortest-path algorithms, such as Dijkstra's (SPF), that OSPF uses, provide exact routing solutions but must be recomputed for each network topology, limiting...
Original headline: "GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization"
Coverage timeline
- Aug 26, 04:00 UTC arXiv cs.LG lead source GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization