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

A randomized NC algorithm for the maximal tree cover problem

โœ Scribed by Zhi-Zhong Chen

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
769 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
โœ Ravindra K. Ahuja; James B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 ลฝ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

A Reliable Randomized Algorithm for the
A Reliable Randomized Algorithm for the Closest-Pair Problem
โœ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an ร„ 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

A Polylogarithmic Approximation Algorith
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
โœ Naveen Garg; Goran Konjevod; R. Ravi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a