2 papers
cs.DM2025
Optimal covering of rectangular grid graphs with tours of constrained length
Sergey Bereg, Jesús Capitán, José-Miguel Díaz-Bañez +4
Given a rectangular grid graph with a special vertex at a corner called base station, we study the problem of covering the vertices of the entire graph with tours that start and en…
cs.CG2025
The Euclidean -Matching Problem is NP-hard
José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López +3
Let be a complete edge-weighted graph on vertices. To each subset of vertices of assign the cost of the minimum spanning tree of the subset as its weight. Suppose that…