Loading...

Spanning trees with minimum weighted degrees

Ghodsi, M ; Sharif University of Technology | 2007

167 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ipl.2007.06.011
  3. Publisher: 2007
  4. Abstract:
  5. Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree of a vertex is defined as the sum of the weights of its incident edges. In this paper, we propose a 4.5-approximation algorithm for this problem. We also prove it is NP-hard to approximate this problem within a 2 - ε factor. © 2007 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Approximation algorithms ; Computational complexity ; Matrix algebra ; Problem solving ; Graph algorithms ; Spanning trees ; Trees (mathematics)
  8. Source: Information Processing Letters ; Volume 104, Issue 3 , 2007 , Pages 113-116 ; 00200190 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0020019007001524