>
Fa   |   Ar   |   En
   Polynomial time approximation schemes for the constrained minimum spanning tree problem  
   
نویسنده chen y.h.
منبع journal of applied mathematics - 2012 - دوره : 2012 - شماره : 0
چکیده    Let g=(v,e) be an undirected graph with a weight function and a cost function on edges. the constrained minimum spanning tree problem is to find a minimum cost spanning tree t in g such that the total weight in t is at most a given bound b. in this paper,we present two polynomial time approximation schemes (ptass) for the constrained minimum spanning tree problem. copyright © 2012 yen hung chen.
آدرس department of computer science,taipei municipal university of education,no. 1 ai-guo west road, Taiwan
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved