Abstract
In [18], L. Lovász provided simple and short proofs for two classic min-max theorems of graph theory by inventing basic techniques to handle sub- or supermodular functions. In this paper, we want to demonstrate that these ideas are alive after thirty years of their birth.
Research supported by the Hungarian National Foundation for Scientific Research, OTKA K60802. The work was completed while the second author visited the Research Institute for Mathematical Sciences, Kyoto University, 2008.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Edmonds, Submodular functions, matroids and certain polyhedra, in: Combinatorial Structures and their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds.), Gordon and Breach, New York (1970), pp 69–87.
J. Edmonds, Edge-disjoint branchings, in: Combinatorial Algorithms (B. Rustin, ed.), Acad. Press, New York, (1973), 91–96.
J. Edmonds, Matroid intersection, Annals of Discrete Math., 4 (1979), 39–49.
J. Edmonds and R. Giles, A min-max relation for submodular functions on graphs, Annals of Discrete Mathematics, 1 (1977), 185–204.
A. Frank, Kernel systems of directed graphs, Acta Scientiarum Mathematicarum (Szeged), 41, 1–2 (1979), 63–76.
A. Frank, Submodular flows, in: Progress in Combinatorial Optimization (ed. W. Pulleyblank), Academic Press (1984), 147–165.
A. Frank and É. Tardos, An application of submodular flows, Linear Algebra and its Applications, 114/115 (1989), 329–348.
A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. on Discrete Mathematics (1992 February), Vol. 5, No. 1, pp. 22–53.
A. Frank, Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994 (J. R. Birge and K. G. Murty, eds.), The University of Michigan, pp. 34–63.
A. Frank, Rooted k-connections in digraphs, Discrete Applied Mathematics, to appear.
A. Frank and T. Jordán, Minimal edge-coverings of pairs of sets, J. Combinatorial Theory, Ser. B., Vol. 65, No. 1 (1995, September), pp. 73–110.
A. Frank, T. Király and M. Kriesell, On decomposing a hypergraph into k connected sub-hypergraphs, in: Submodularity (guest editor S. Fujishige), Discrete Applied Mathematics, Vol. 131, Issue 2. (September 2003), pp. 373–383.
S. Iwata, L. Fleischer and S. Fujishige, A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, J. of the ACM, 48, 4 (2001), pp. 761–777. A preliminary version appeared in: Proceedings of the 32’nd STOC 2000, held in Portland, Oregon USA, pp. 97–106.
N. Kamiyama, N. Katoh and A. Takizawa, Arc-disjoint in-trees in directed graphs, in: Proc. the nineteenth Annual ACM-SIAM Symposium on Discrete Mathematics (SODA 2008), pp. 218–526, 2008. The journal version is going to appear in Combinatorica.
T. Király, Edge-connectivity of undirected and directed hypergraphs, Ph.D. Dissertation (2003), Eötvös University, Budapest, see: p. 126.
L. Lovász, Solution to Problem 11, see pp. 168–169 in: Report on the Memorial Mathematical Contest Miklós Schweitzer of the year 1968, (in Hungarian), Matematikai Lapok, 20 (1969), pp. 145–171.
L. Lovász, A generalization of Kőnig’s theorem, Acta. Math. Acad. Sci. Hungar., 21 (1970), 443–446.
L. Lovász, On two minimax theorems in graph theory, J. Combinatorial Theory (B), 21 (1976), 96–103.
C. L. Lucchesi and D. H. Younger, A minimax relation for directed graphs, J. London Math. Soc. (2), 17 (1978), 369–374.
J. Pap, A note on making two bipartite graphs perfectly matchable, EGRES quickproof series QP-2006-04, (http://www.cs.elte.hu/egres/www/quickproof.html).
A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Journal of Combinatorial Theory, Ser. B., Vol. 80 (2000), pp. 575–588.
L. Szegő, Note on covering intersecting set-systems by digraphs, Discrete Mathematics, 234 (2001), 187–189.
R. E. Tarjan, A good algorithm for edge-disjoint branching, Information Processing Letters, 3 (1974), 52–53.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Lovász Laci on the occasion of his 60’th birthday by his youngest and oldest mathematical descendants
Rights and permissions
Copyright information
© 2008 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Bérczi, K., Frank, A. (2008). Variations for Lovász’ Submodular Ideas. In: Grötschel, M., Katona, G.O.H., Sági, G. (eds) Building Bridges. Bolyai Society Mathematical Studies, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85221-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-85221-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85218-6
Online ISBN: 978-3-540-85221-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)