Exact Algorithms for the Minimum Load Spanning Tree Problem

DOI10.1287/ijoc.2020.1011OpenAlexW3126463456MaRDI QIDQ5084607

Xiaojun Zhu, Shaojie Tang

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.1011

zbMATH Keywords

exact algorithmwireless sensor networksminimum load spanning tree

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Approximating bounded-degree spanning trees and connected factors with leaves
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
• Inclusion/exclusion meets measure and conquer
• Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks
• Algorithms for k-Internal Out-Branching
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Spotting Trees with Few Leaves
• Determinant Sums for Undirected Hamiltonicity
• Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

This page was built for publication: Exact Algorithms for the Minimum Load Spanning Tree Problem