Random sampling in matroids, with applications to graph connectivity and minimum spanning trees

Authors:
D. R. Karker
Affiliations:
Dept. of Comput. Sci., Stanford Univ., CA, USA
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 3

Algorithms on evolving graphs

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Sensor fusion: from dependence analysis via matroid bases to online synthesis

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Research paper: The saga of minimum spanning trees

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random sampling is a powerful way to gather information about a group by considering only a small part of it. We give a paradigm for applying this technique to optimization problems, and demonstrate its effectiveness on matroids. Matroids abstractly model many optimization problems that can be solved by greedy methods, such as the minimum spanning tree (MST) problem. Our results have several applications. We give an algorithm that uses simple data structures to construct an MST in O(m+n log n) time. We give bounds on the connectivity (minimum cut) of a graph suffering random edge failures. We give fast algorithms for packing matroid bases, with particular attention to packing spanning trees in graphs.