.png){kind=icon}
Return
Primal dual based algorithm for degree-balanced spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2017.08.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 Sigma v is an element of V deg(T)(v)(2) is minimized, where deg T (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. (C) 2017 Elsevier Inc. All rights reserved.
Keywords:
Degree-balanced spanning tree
Nonlinear objective function
Primal dual algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations
.png){kind=icon}
