| Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Given an undirected connected graph G = (V,E) with a set V of vertices, a set E of edges, and costs cij associated to every edge [i,j] ∈ E, with i < j, the Diameter Minimum Spanning Tree Problem (DCMST) consists in finding a minimum spanning tree T = (V,E ′), with E ′ ⊆ E, where the diameter | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||