Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

AAIM
2010
Springer

favoriteEmaildiscussreport

155views Algorithms» more AAIM 2010»

The (K, k)-Capacitated Spanning Tree Problem

14 years 2 months ago

The (K, k)-Capacitated Spanning Tree Problem

Download www.ams.sunysb.edu

Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that the problem can be approximated within a constant factor, and present better approximations when k is 1 or 2.

Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Real-time Traffic

AAIM 2010 | Algorithms | Capacity K | Present Better Approximations | Spanning Tree |

claim paper

Related Content

» An Olog k approximation algorithm for the k minimum spanning tree problem in the plane

» Broadcasting in n kArrangement Graph Based on an Optimal Spanning Tree

» A Linear Vertex Kernel for Maximum Internal Spanning Tree

» An approximate solution method based on tabu search for kminimum spanning tree problems

» On the Directed DegreePreserving Spanning Tree Problem

» Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k2 and 3

» On the directed Full Degree Spanning Tree problem

» An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

Post Info
More Details (n/a)

Added	08 Sep 2010
Updated	08 Sep 2010
Type	Conference
Year	2010
Where	AAIM
Authors	Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

Comments (0)