Skip to main content
SpringerLink
Log in

A Survey on Covering Supermodular Functions

  • Chapter
Research Trends in Combinatorial Optimization

Summary

In this survey we present recent advances on problems that can be described as the construction of graphs or hypergraphs that cover certain set functions with supermodular or related properties. These include a wide range of network design and connectivity augmentation and orientation problems, as well as some results on colourings and matchings.

In the first part of the paper we survey results that follow from the totally dual integral (TDI) property of various systems defined by supermodular-type set functions. One of the aims of the survey is to emphasize the importance of relaxing the supermodularity property to include a wider range of set functions. We show how these relaxations lead to a unified understanding of different types of applications.

The second part is devoted to results that, according to our current knowledge, cannot be explained using total dual integrality. We would like to demonstrate that an extensive theory independent of total dual integrality has been developed in the last 15 years, centered around various connectivity augmentation problems.

Our survey concentrates on the theoretical foundations, and does not include every detail on applications, since the majority of these applications are described in detail in another survey paper by the first author (Frank 2006). The comprehensive book “Combinatorial Optimization: Polyhedra and Efficiency” by Schrijver (2003) is also a rich resource of results related to submodular functions.

It should be noted that sub- and supermodularity have several applications in areas not discussed in this paper. In particular, we should mention the book “Submodular Functions and Optimization” by Fujishige (2005) and the book “Discrete Convex Analysis” by Murota (2003). The former explains the foundations of the theory of submodular functions and describes the methods of submodular analysis, while the latter presents a unified framework for nonlinear discrete optimization by extending submodular function theory using ideas from continuous optimization. Our survey focuses on topics not discussed in detail in those books.

Supported by the Hungarian National Foundation for Scientific Research, OTKA K60802. The authors are members of the MTA-ELTE Egerváry Research Group.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bérczi, K., Frank, A.: Variations for Lovász’ submodular ideas. In: Grötschel, M., Katona, G.O.H. (eds.) Building Bridges Between Mathematics and Computer Science. Bolyai Society Mathematical Studies, vol. 19, pp. 137–164. Springer, Berlin (2008)

    Google Scholar 

  • Berg, A., Jackson, B., Jordán, T.: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Math. 273, 71–84 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Bernáth, A., Király, T.: Covering symmetric skew-supermodular functions with hyperedges. EGRES Technical Report No. 2008-05 (2008)

    Google Scholar 

  • Bertsimas, D., Teo, C.: The parsimonious property of cut covering problems and its applications. Oper. Res. Lett. 21, 123–132 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Cai, M.-c.: Arc-disjoint arborescences of digraphs. J. Graph Theory 7, 235–240 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  • Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69–87. Gordon and Breach, New York (1970)

    Google Scholar 

  • Edmonds, J.: Edge-disjoint branchings. In: Rustin, B. (ed.) Combinatorial Algorithms, pp. 91–96. Academic Press, New York (1973)

    Google Scholar 

  • Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)

    Article  MathSciNet  Google Scholar 

  • Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653–665 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A.: On disjoint trees and arborescences. In: Algebraic Methods in Graph Theory. Colloquia Mathematica Societatis Janos Bolyai, vol. 25, pp. 159–169. North-Holland, Amsterdam (1978)

    Google Scholar 

  • Frank, A.: Kernel systems of directed graphs. Acta Sci. Math. 41, 63–76 (1979)

    MATH  Google Scholar 

  • Frank, A.: On the orientation of graphs. J. Comb. Theory, Ser. B 28(3), 251–261 (1980)

    Article  MATH  Google Scholar 

  • Frank, A.: Generalized polymatroids. In: Finite and Infinite Sets, Eger, 1981. Colloquia Mathematica Societatis Janos Bolyai, vol. 37, pp. 285–294. North-Holland, Amsterdam (1981)

    Google Scholar 

  • Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97–120 (1982)

    MATH  Google Scholar 

  • Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 22–53 (1992)

    Article  Google Scholar 

  • Frank, A.: Applications of submodular functions. In: Walker, K. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 187, pp. 85–136. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  • Frank, A.: Connectivity augmentation problems in network design. In: Birge, J.R., Murty, K.G. (eds.) Mathematical Programming: State of the Art, pp. 34–63. The University of Michigan Press, Ann Arbor (1994)

    Google Scholar 

  • Frank, A.: Orientations of graphs and submodular flows. Congr. Numer. 113, 111–142 (1996)

    MATH  MathSciNet  Google Scholar 

  • Frank, A.: Restricted t-matchings in bipartite graphs. Discrete Appl. Math. 131, 337–346 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A.: Edge-connection of graphs, digraphs, and hypergraphs. In: More Sets, Graphs and Numbers. Bolyai Society Mathematical Studies, vol. 15, pp. 93–141. Springer, Berlin (2006)

    Google Scholar 

  • Frank, A.: Rooted k-connections in digraphs. Discrete Appl. Math. (2008), to appear

    Google Scholar 

  • Frank, A., Jordán, T.: Minimal edge-coverings of pairs of sets. J. Comb. Theory 65(1), 73–110 (1995)

    Article  MATH  Google Scholar 

  • Frank, A., Király, T.: Combined connectivity augmentation and orientation problems. Discrete Appl. Math. 131, 401–419 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., Tardos, É.: Generalized polymatroids and submodular flows. Math. Program., Ser. B 42, 489–563 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., Tardos, É.: An application of submodular flows. Linear Algebra Appl. 114/115, 329–348 (1989)

    Article  MathSciNet  Google Scholar 

  • Frank, A., Karzanov, A.V., Sebő, A.: On integer multiflow maximization. SIAM J. Discrete Math. 10(1), 158–170 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., Jordán, T., Szigeti, Z.: An orientation theorem with parity conditions. Discrete Appl. Math. 115, 37–45 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., Király, T., Király, Z.: On the orientation of graphs and hypergraphs. Discrete Appl. Math. 131, 385–400 (2003a)

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., Király, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Appl. Math. 131, 373–383 (2003b)

    Article  MATH  MathSciNet  Google Scholar 

  • Fujishige, S.: Structures of polyhedra determined by submodular functions on crossing families. Math. Program. 29, 125–141 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  • Fujishige, S.: Submodular Functions and Optimization, 2nd edn., Ann. Discrete Math., vol. 58, Elsevier, Amsterdam (2005)

    MATH  Google Scholar 

  • Goemans, M.X., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60, 145–166 (1993)

    Article  MathSciNet  Google Scholar 

  • Győri, E.: A minmax theorem on intervals. J. Comb. Theory, Ser. B 37, 1–9 (1984)

    Article  Google Scholar 

  • Kamiyama, N., Katoh, N., Takizawa, A.: Arc-disjoint in-trees in directed graphs. In: Proc. Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 518–526 (2008)

    Google Scholar 

  • Karzanov, A.V., Lomonosov, M.V.: Systems of flows in undirected networks. In: Larychev, O.I. (ed.) Mathematical Programming, vol. 1, pp. 59–66. Institute for System Studies, Moscow (1978) (in Russian)

    Google Scholar 

  • Khanna, S., Naor, J., Shepherd, F.B.: Directed network design with orientation constraints. SIAM J. Discrete Math. 19(1), 245–257 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Király, T.: Covering symmetric supermodular functions by uniform hypergraphs. J. Comb. Theory, Ser. B 91, 185–200 (2004)

    Article  MATH  Google Scholar 

  • Király, T.: Merging hyperedges to meet edge-connectivity requirements. EGRES Technical Report No. 2005-08. Hungarian version: Mat. Lapok 13(1), 28–31 (2007a)

    Google Scholar 

  • Király, T.: Applications of Eulerian splitting-off. EGRES Technical Report No. 2007-01. In: Proceedings of Hungarian–Japanese Symposium on Discrete Mathematics and its Applications, pp. 298–307 (2007b)

    Google Scholar 

  • Király, T., Makai, M.: A note on hypergraph connectivity augmentation. EGRES Technical Report No. 2002-11. Hungarian version: Mat. Lapok 13(1), pp. 32–39 (2007)

    Google Scholar 

  • Király, T., Szabó, J.: A note on parity constrained orientations. Combinatorica, to appear

    Google Scholar 

  • Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Algorithms and Combinatorics, vol. 21, Springer, Berlin (2008)

    Google Scholar 

  • Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etud. Rech. Oper. 17, 289–291 (1975)

    MATH  MathSciNet  Google Scholar 

  • Lovász, L.: A generalization of Kőnig’s theorem. Acta Math. Acad. Sci. Hungar. 21, 443–446 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  • Lovász, L.: On some connectivity properties of Eulerian graphs. Acta Math. Acad. Sci. Hungar. 28, 129–138 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  • Lovász, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)

    MATH  Google Scholar 

  • Lucchesi, C.L., Younger, D.H.: A minmax relation for directed graphs. J. Lond. Math. Soc. 17(2), 369–374 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  • Makai, M., Szabó, J.: The parity problem of polymatroids without double circuits. Combinatorica, to appear

    Google Scholar 

  • Makai, M., Pap, Gy., Szabó, J.: Matching problems in polymatroids without double circuits. In: Fischetti, M., Williamson, D.P. (eds.) Proc. IPCO XII. Lecture Notes in Computer Science, vol. 4513, pp. 167–181. Springer, Berlin (2007)

    Google Scholar 

  • Murota, K.: Discrete Convex Analysis. Monographs on Discrete Mathematics and Applications, vol. 10, SIAM, Philadelphia (2003)

    MATH  Google Scholar 

  • Nash-Williams, C.St.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)

    Article  MathSciNet  Google Scholar 

  • Nebeský, L.: A new characterization of the maximum genus of a graph. Czechoslov. Math. J. 31(106), 604–613 (1981)

    Google Scholar 

  • Rado, R.: A theorem on independence relations. Q.J. Math. 13(2), 83–89 (1942)

    Article  MathSciNet  Google Scholar 

  • Schrijver, A.: Total dual integrality from directed graphs, crossing families and sub- and supermodular functions. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 315–362. Academic Press, New York (1984)

    Google Scholar 

  • Schrijver, A.: Supermodular colourings. In: Matroid Theory, Szeged, 1982. Colloquia Mathematica Societatis János Bolyai, vol. 40, pp. 327–343. North-Holland, Amsterdam (1985)

    Google Scholar 

  • Schrijver, A.: Short proofs on multicommodity flows and cuts. J. Comb. Theory, Ser. B 53, 32–39 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  • Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24, Springer, Berlin (2003)

    MATH  Google Scholar 

  • Szegő, L.: A note on covering intersecting set-systems by digraphs. Discrete Math. 234(1–3), 187–189 (2001)

    Article  MathSciNet  Google Scholar 

  • Szigeti, Z.: Hypergraph connectivity augmentation. Math. Program., Ser. B 84(3), 519–527 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Vidyasankar, K.: Covering the edge-set of a directed graph with trees. Discrete Math. 24, 79–85 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Eötvös Loránd University, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

    András Frank & Tamás Király

Authors
  1. András Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tamás Király
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Industrial and Systems Engineering, Georgia Tech, 765 Ferst Drive, Atlanta, Georgia, 30332-0205, USA

    William Cook

  2. Institute of Mathematics, Eötvös Loránd University, Pázmány Péter sétány 1/C, H-1117, Budapest, Hungary

    László Lovász

  3. Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113, Bonn, Germany

    Jens Vygen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Frank, A., Király, T. (2009). A Survey on Covering Supermodular Functions. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_6

Download citation

Publish with us

Policies and ethics

Search

Navigation