Skip to main content
SpringerLink
Log in

Random sampling and greedy sparsification for matroid optimization problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: finding an optimum matroid basis and packing disjoint matroid bases. Application of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by agreedy algorithm that grows an independent set into an optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a givenfixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Barahona, Separating from the dominant of the spanning tree polytope, Operations Research Letters 12 (1992) 201–203.

    Google Scholar 

  2. F. Barahona, Packing spanning trees, Mathematics of Operation Research 20 (1) (1995) 104–115.

    Google Scholar 

  3. A.A. Benczúr, D.R. Karger, Approximates—t min-cuts in Õ(n 2) time, Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 47–55.

    Google Scholar 

  4. B. Bollobás, Random Graphs, Harcourt. Brace and Janovich, New York, 1985.

    Google Scholar 

  5. H. Chernoff, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics 23 (1952) 493–509.

    Google Scholar 

  6. C.J. Colbourn, The Combinatorics of Network Reliability, The International Series of Monographs on Computer Science, vol. 4, Oxford University Press, Oxford, 1987.

    Google Scholar 

  7. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  8. B. Dixon, M. Rauch, R.E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM Journal on Computing 21 (6) (1992) 1184–1192.

    Google Scholar 

  9. J. Edmonds, Minimum partition of a matroid into independents subsets, Journal of Research of the National Bureau of Standards 69 (1965) 67–72.

    Google Scholar 

  10. J. Edmonds, Matroids and the greedy algorithm, Mathematical Programming 1 (1971) 126–136.

    Google Scholar 

  11. P. Erdös, A. Rényi, On random graphs I, Publicacions Matematiques Debrecen 6 (1959) 290–297.

    Google Scholar 

  12. T. Feder, M. Mihail, Balanced matroids, Proceedings of the 24th ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 26–38.

    Google Scholar 

  13. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1, 3rd ed., Wiley, New York, 1968.

    Google Scholar 

  14. R.W. Floyd, R.L. Rivest, Expected time bounds for selection, Communications of the ACM 18 (3) (1975) 165–172.

    Google Scholar 

  15. H.N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, Journal of Computer and System Sciences 50 (2) (1995) 259–273.

    Google Scholar 

  16. H.N. Gabow, H.H. Westermann, Forests, frames, and games: Algorithms for matroid sums and applications, Algorithmica 7 (5) (1992) 465–497.

    Google Scholar 

  17. D. Gusfield, Connectivity and edge disjoint spanning trees, Information Processing Letters 16 (1983) 87–89.

    Google Scholar 

  18. A. Itai, M. Rodeh, The multi-tree approach to reliability in distributed networks, Information and Control 79 (1988) 43–59.

    Google Scholar 

  19. D.R. Karger, Approximating, verifying, and constructing minimum spanning forests, Manuscript, 1992.

  20. D.R. Karger, Random sampling in matroids, with applications to graph connectivity and minimum spanning trees, Proceedings of the 34th Annual Symposium on the Foundations of Computer Science, IEEE Computer Soc. Press, Silver Spring, MD, 1993, pp. 84–93 (submitted for publication).

    Google Scholar 

  21. D.R. Karger, Random sampling in cut, flow, and network design problems, Proceedings of the 26th ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 648–657. To appear in Mathematics of Operations Research.

    Google Scholar 

  22. D.R. Karger, Minimum cuts in near-linear time, Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 56–63.

    Google Scholar 

  23. D.R. Karger, Using random sampling to find flows in uncapacitated undirected graphs, Proceedings of the 29th ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 240–249.

    Google Scholar 

  24. D.R. Karger, P.N. Klein, R.E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, Journal of the ACM 42 (2) (1995) 321–328.

    Google Scholar 

  25. D.R. Karger, C. Stein, A new approach to the minimum cut problem, Journal of the ACM 43 (4) (1996) 601–640 (preliminary portions appeared in SODA 1992 and STOC 1993).

    Google Scholar 

  26. R.M. Karp, Probabilistic recurrence relations, Proceedings of the 23rd ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 190–197.

    Google Scholar 

  27. P.N. Klein, R.E. Tarjan, A randomized linear-time algorithm for finding minimum spanning trees, Proceedings of the 26th ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 9–15.

    Google Scholar 

  28. D.E. Knuth, Matroid partitioning, Technical Report STAN-CS-73-342, Stanford University, 1973.

  29. D.E. Knuth, A.C. Yao, The complexity of nonuniform random number generation, in: J.F. Traub (Ed.), Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York, 1976, pp. 357–428.

    Google Scholar 

  30. J.B. Kruskal Jr., On the shortest spanning subtree of a graph and the travelling salesman problem, Proceedings of the American Mathematical Society 7 (1) (1956) 48–50.

    Google Scholar 

  31. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.

    Google Scholar 

  32. J. Lee, J. Ryan, Matroid applications and algorithms, ORSA Journal on Computing 4 (1) (1992) 70–96.

    Google Scholar 

  33. D.W. Matula, Determining edge connectivity in O(nm), Proceedings of the 28th Annual Symposium on the Foundations of Computer Science, IEEE Computer Soc. Press, Silver Spring, MD, 1987, pp. 249–251.

    Google Scholar 

  34. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.

    Google Scholar 

  35. K. Mulmuley, Computational Geometry, Prentice-Hall, Englewood Cliffs, NJ, 1994.

    Google Scholar 

  36. H. Nagamochi, T. Ibaraki, Computing edge connectivity in multigraphs and capacitated graphs, SIAM Journal of Discrete Mathematics 5 (1) (1992) 54–66.

    Google Scholar 

  37. C. St, J.A. Nash-Wiliams, Edge disjoint spanning trees of finite graphs, Journal of the London Mathematical Society 36 (1961) 445–450.

    Google Scholar 

  38. V.P. Polesskii, Bounds on the connectedness probability of a random graph, Problems of Information Transmition 27 (1990) 86–97.

    Google Scholar 

  39. A. Recski, Matroid Theory and its Applications In Electric Network Theory and in Statics, Number 6 in Algorithms and Combinatorics, Springer, Berlin, 1989.

    Google Scholar 

  40. J.H. Reif, P. Spirakis, Random matroids, Proceedings of the 12th ACM Symposium on Theory of Computing, 1980, pp. 385–397.

  41. A. Schrijver (Ed.), Packing and covering in combinatorics, Number 106 in Mathematical Centre Tracts, Mathematical Centre, 1979.

  42. B.L. Van Der Waerden, Moderne Algebra, Springer, Berlin, 1937.

    Google Scholar 

  43. D.J.A. Welsh, Matroid Theory, London Mathematical Society Monographs, Academic Press, New York, 1976.

    Google Scholar 

  44. H. Whitney, On the abstract properties of linear independence, American Journal of Mathematics 57 (1935) 509–533.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, MIT, 02139, Cambridge, MA, USA

    David R. Karger

Authors
  1. David R. Karger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Some of this work done at Stanford University, supported by National Science Foundation and Hertz Foundation Graduate Fellowships, and NSF Young Investigator Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation and Xerox Corporation. Also supported by NSF award 962-4239.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karger, D.R. Random sampling and greedy sparsification for matroid optimization problems. Mathematical Programming 82, 41–81 (1998). https://doi.org/10.1007/BF01585865

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585865

Keywords

Search

Navigation