Primal dual based algorithm for degree-balanced spanning tree problem

Yingli Ran, Zhihao Chen, Shaojie Tang and Zhao Zhang

Applied Mathematics and Computation, 2018, vol. 316, issue C, 167-173

Abstract: This paper studies approximation algorithm for the degree-balanced spanning tree (DBST) problem. Given a graph G=(V,E), the goal is to find a spanning tree T such that ∑v ∈ VdegT(v)2 is minimized, where degT(v) denotes the degree of node v in tree T. The idea of taking squares on node degrees is to manifest the role of nodes with large degree, and thus minimizing the sum will result in a comparatively balanced degree distribution. This is a non-linear objective function. We prove that DBST is NP-hard, and then develop a primal–dual based algorithm with a guaranteed performance ratio.

Keywords: Degree-balanced spanning tree; Nonlinear objective function; Primal dual algorithm (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317305672
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:316:y:2018:i:c:p:167-173

DOI: 10.1016/j.amc.2017.08.016

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().