Abstract
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, we introduce a combinatorial model that allows us to define and analyze matroid-type greedy algorithms. The model is based on a real-valued function v on a (finite) family of sets which yields the constraints of a combinatorial linear program. Moreover, v gives rise to a ranking and selection procedure for the elements of the ground set N and thus implies a greedy algorithm for the linear program. It is proved that the greedy algorithm is guaranteed to produce primal and dual optimal solutions if and only if an associated functional on \({\mathbb{R}^N}\) is concave. Previous matroid-type greedy models are shown to fit into the present general context. In particular, a general model for combinatorial optimization under supermodular constraints is presented which guarantees the greedy algorithm to work.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Borradaile, G., Klein, P.: An O(n log n) algorithm for maximum st-flow in a directed planar graph. In: SODA, pp. 524–533. ACM, New York. ISBN: 0-89871-605-5 (2006)
Choquet G.: Theory of capacities. Ann. Inst. Fourier 5, 131–295 (1953)
Dietrich B.L., Hoffman A.J.: On greedy algorithms, partially ordered sets, and submodular functions. IBM J. Res. Dev. 47, 25–30 (2003)
Edmonds J.: Optimum branchings. J. Res. Nat. Bur. Stand. B 71, 233–240 (1967)
Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Proceedings of International Conference on Combinatorics (Calgary) pp. 69–87 (1970)
Edelman P.H., Jamison R.E.: The theory of convex geometries. Geometriae Dedicata 19, 247–270 (1985)
Faigle U., Fujishige S.: A general model for matroids and the greedy algorithm. Math. Program. A 119, 353–369 (2009)
Faigle U., Grabisch M., Heyne M.: Monge extensions of cooperation and communication structures. Eur. J. Oper. Res. 206, 104–110 (2010)
Faigle U., Kern W.: On the core of ordered submodular cost games. Math. Program. 87, 483–489 (2000)
Faigle, U., Peis, B.: Two-phase greedy algorithms for some classes of combinatorial linear programs. In: Proceedings SODA 2008, San Francisco, pp. 161–166 (2008)
Frank A.: Increasing the rooted-connectivity of a digraph by one. Math. Program. 84, 565–576 (1999)
Ford L.R., Fulkerson D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)
Fujishige S.: Dual greedy polyhedra, choice functions, and abstract convex geometries. Discrete Optim. 1, 41–49 (2004)
Fujishige, S.: Submodular Functions and Optimization. 2nd ed. In: Ann. Discrete Mathematics, vol. 58. (2005)
Fulkerson D.R.: Packing rooted directed cuts in a weighted directed graph. Math. Program. 6, 1–13 (1974)
Hoffman A.J.: Ordered sets and linear programming. Ordered Sets, pp. 619–654. D. Reidel Publishing Company, Boston (1981)
Hoffman A.J.: On greedy algorithms that succeed. Surveys in Combinatorics, pp. 97–112. Cambridge University Press, Cambridge (1985)
Hoffman, A.J., Schwartz, D.E.: On lattice polyhedra. In: Hajnal, A., Sós, V.T. (eds.) Proceedings of 5th Hungarian Conference in Combinatorics, pp. 593–598. North-Holland, Amsterdam (1978)
Hoffman A.J., Kolen A.W.J., Sakarowitch M.: Totally balanced and greedy matrices. SIAM J. Alg. Discr. Methods 6, 721–730 (1985)
Johnson E.: On cut-set integer polyhedra. Cahiers du Centre d’Études de Recherche Opérationnelle 17, 235–251 (1975)
Lovász L. et al.: Submodular functions and convexity. In: Bachem, A. (eds) Mathematical Programming: The State of the art, pp. 235–257. Springer-Verlag, Berlin (1983)
Murota K.: Discrete Convex Analysis. SIAM Monographs on Discrete Mathematics and Applications, vol. 10. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2003)
Moulin H.: Choice functions over a finite set: a summary. Soc. Choice Welfare 2, 147–160 (1985)
Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Shapley L.S.: Cores of convex games. Int. J. Game Theory 1, 12–26 (1971)
Acknowledgments
The authors thank the referees for their comments and remarks on the manuscript, which have helped to improve the presentation of the article.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Faigle, U., Kern, W. & Peis, B. A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132, 393–407 (2012). https://doi.org/10.1007/s10107-010-0406-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0406-2