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

Random pseudo-polynomial algorithms for exact matroid problems

โœ Scribed by P.M Camerini; G Galbiati; F Maffioli

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
852 KB
Volume
13
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Theoretic and Practical Algori
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
โœ Harold N. Gabow; Ying Xu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 754 KB

Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case, but takes advantage of greater structure. Efficiency of the algorithms

Exact algorithms for the master ring pro
Exact algorithms for the master ring problem
โœ Hadas Shachnai; Lisa Zhang; Tomomi Matsui ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB

## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,โ€ฆ,__R__~__K__~, with __n__~1~,โ€ฆ,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in