๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximating optimum branchings in linear time

โœ Scribed by Valentin Ziegler

Book ID
108154593
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
174 KB
Volume
109
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating the Metric TSP in Linear T
Approximating the Metric TSP in Linear Time
โœ Davide Bilรฒ; Luca Forlizzi; Guido Proietti ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer ๐ŸŒ English โš– 693 KB
Approximating Edit Distance in Near-Line
Approximating Edit Distance in Near-Linear Time
โœ Andoni, Alexandr; Onak, Krzysztof ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 248 KB
Approximating Maximum Leaf Spanning Tree
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
โœ Hsueh-I Lu; R Ravi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

Given an undirected graph, finding a spanning tree of the graph with the maximum number of leaves is MAX SNP-complete. In this paper we give a new greedy 3-approximation algorithm for maximum leaf spanning trees. The running ลฝลฝ . ลฝ .. time O m q n โฃ m, n required by our algorithm, where m is the num