Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon.

arXiv:2610.00422v1 Announce Type: cross Abstract: Neural combinatorial optimization typically assumes a centralized solver that reads the whole instance. We study the opposite: combinatorial optimization under a hard information horizon, where every node commi