A Push-Relabel Algorithm for Approximating Degree Bounded MSTs

Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar

Abstract: Given a graph G and degree bound B on its nodes, the bounded-degree minimum spanning tree (BDMST) problem is to find a minimum cost spanning tree among the spanning trees with maximum degree B. This bi-criteria optimization problem generalizes several combinatorial problems, including the Traveling Salesman Path Problem (TSPP).