Primal dual based algorithm for degree-balanced spanning tree problem

DOI10.1016/j.amc.2017.08.016zbMath1426.68306OpenAlexW2757589774MaRDI QIDQ1740242

Shaojie Tang, Yingli Ran, Zhao Zhang, Zhihao Chen

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.08.016

zbMATH Keywords

nonlinear objective functionprimal dual algorithmdegree-balanced spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Maintaining Balanced Trees for Structured Distributed Streaming Systems
• Continuous Relaxation for Discrete DC Programming
• DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS