4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DM2022★ 4 cited
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
Phillippe Samer, Dag Haugland
Given a graph and a set of unordered pairs of edges regarded as being in conflict, a stable spanning tree in is a set of edges inducing a spanning tree in …
math.OC2021
Strong bounds and exact solutions to the minimum broadcast time problem
Marika Ivanova, Dag Haugland, Bård Hennning Tvedt
Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast problem asks for the minimum number of steps in which a signal can be transmitted from t…