Loading...
  1. Simple search
  2. Search result
Search for: mirjalali--k
0.005 seconds
Total 1 records

      Spanning trees with minimum weighted degrees

      , Article Information Processing Letters ; Volume 104, Issue 3 , 2007 , Pages 113-116 ; 00200190 (ISSN) Ghodsi, M ; Mahini, H ; Mirjalali, K ; Oveis Gharan, S ; Sayedi Roshkhar, A. S ; Zadimoghaddam, M ; Sharif University of Technology
      2007
      Abstract
      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  
    Total 1 records