Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

2004 ◽  
Author(s):  
Michael Elkin
Keyword(s):  
Lower Bounds ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Time Approximation ◽  
Minimum Spanning Tree Problem

Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

2015 ◽  
Vol 63 ◽  
pp. 149-160 ◽  
Author(s):  
Dilson Lucas Pereira ◽  
Michel Gendreau ◽  
Alexandre Salles da Cunha
Keyword(s):  
Lower Bounds ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Exact Algorithms ◽  
Minimum Spanning Tree Problem

scholarly journals Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Yen Hung Chen
Keyword(s):  
Weight Function ◽  
Polynomial Time ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Undirected Graph ◽  
Minimum Cost ◽  
Approximation Schemes ◽  
Time Approximation ◽  
Minimum Spanning Tree Problem ◽  
Polynomial Time Approximation

LetG=(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 treeTinGsuch that the total weight inTis at most a given boundB. In this paper, we present two polynomial time approximation schemes (PTASs) for the constrained minimum spanning tree problem.

Sign in / Sign up

Export Citation Format

Share Document