Summary
A. Frank (Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1), 22–53, 1992) developed a method to solve edge-connectivity augmentation problems. His paper has stimulated further research in a number of directions, including many interesting generalizations.
This paper surveys the current State of the Art on the edge-connectivity augmentation problem. Recent extensions of the problem are presented for undirected graphs, hypergraphs and more generally for set functions. Shortened proofs are provided for some of the results. A list of open problems is also presented.
Some part of this work was done while the author was visiting the Research Institute for Discrete Mathematics, University of Bonn, Lennéstrasse 2, 53113. Bonn, Germany by an Alexander von Humboldt fellowship.
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
Bang-Jensen, J., Jackson, B.: Augmenting hypergraphs by edges of size two. Math. Program. 84(3), 467–481 (1999)
Bang-Jensen, J., Jordán, T.: Edge-connectivity augmentation preserving simplicity. SIAM J. Discrete Math. 11(4), 603–623 (1998)
Bang-Jensen, J., Jordán, T.: Splitting off edges within a specified subset preserving the edge-connectivity of the graph. J. Algorithms 37, 326–343 (2000)
Bang-Jensen, J., Frank, A., Jackson, B.: Preserving and increasing local edge-connectivity in mixed graphs. SIAM J. Discrete Math. 8(2), 155–178 (1995)
Bang-Jensen, J., Gabow, H., Jordán, T., Szigeti, Z.: Edge-connectivity augmentation with partition constraints. SIAM J. Discrete Math. 12(2), 160–207 (1999)
Benczúr, A., Frank, A.: Covering symmetric supermodular functions by graphs. Math. Program. 84(3), 483–503 (1999)
Bernáth, A., Király, T.: Personal communication (2007)
Cai, G.R., Sun, Y.G.: The minimum augmentation of any graph to k-edge-connected graphs. Networks 19, 151–172 (1989)
Cheng, E., Jordán, T.: Successive edge-connectivity augmentation problems. Math. Program. 84(3), 577–593 (1999)
Cosh, B.: Vertex splitting and connectivity augmentation in hypergraphs. Ph.D. thesis, University of London (2000)
Cosh, B., Jackson, B., Király, Z.: Local connectivity augmentation in hypergraphs is NP-complete. Submitted (2008)
Eswaran, K.P., Tarjan, E.: Augmentation problems. SIAM J. Comput. 5, 653–665 (1976)
Fleiner, B.: Detachments of vertices of graphs preserving edge-connectivity. SIAM J. Discrete Math. 18(3), 581–591 (2005)
Fleiner, T., Jordán, T.: Covering and structure of crossing families. Math. Program. 84(3), 505–518 (1999)
Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 22–53 (1992a)
Frank, A.: On a theorem of Mader. Discrete Math. 101, 49–57 (1992b)
Frank, A.: Personal communication (1999)
Grappe, R., Szigeti, Z.: Covering semi-monotone symmetric functions. Discrete Appl. Math. 156, 138–144 (2008)
Ishii, T.: Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. In: Proc. of the 13th Australasian Symp. on Theory of Comp., pp. 91–100 (2007)
Ishii, T., Hagiwara, M.: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Appl. Math. 154, 2307–2329 (2006)
Jackson, B.: Some remarks on connectivity, vertex splitting and orientation in digraphs. J. Graph Theory 12, 429–436 (1988)
Jordán, T.: Two NP-complete augmentation problems. IMADA, Odense Universitet, Preprint No. 8 (1997)
Jordán, T.: Constrained edge-splitting problems. SIAM J. Discrete Math. 17(1), 88–102 (2003)
Jordán, T., Szigeti, Z.: Detachments preserving local edge-connectivity of graphs. SIAM J. Discrete Math. 17(1), 72–87 (2003)
Király, T.: Merging hyperedges to meet edge-connectivity requirements. Egres Technical Reports, TR-2005-08, http://www.cs.elte.hu/egres/ (2004a)
Király, T.: Covering symmetric supermodular functions by uniform hyperedges. J. Comb. Theory, Ser. B 91, 185–200 (2004b)
Király, Z.: Personal communication (2001)
Lovász, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)
Mader, W.: A reduction method for edge-connectivity in graphs. Ann. Discrete Math. 3, 145–164 (1978)
Nutov, Z.: Approximating connectivity augmentation problems. In: SODA 2005, pp. 176–185 (2005)
Szigeti, Z.: Hypergraph connectivity augmentation. Math. Program. 84(3), 519–527 (1999)
Szigeti, Z.: A short proof on the local detachment theorem. Egres Technical Reports, TR-2004-09, http://www.cs.elte.hu/egres/ (2004a)
Szigeti, Z.: On partition constrained splitting off. Egres Technical Reports, TR-2004-08, http://www.cs.elte.hu/egres/ (2004b)
Szigeti, Z.: Edge-splittings preserving edge-connectivity of graphs. Discrete Appl. Math. 156, 1011–1018 (2008a)
Szigeti, Z.: Edge-connectivity augmentation of graphs over symmetric parity families. Discrete Math., to appear (2008b)
Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. J. Comput. Syst. Sci. 35, 96–144 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Szigeti, Z. (2009). Edge-Connectivity Augmentations of Graphs and Hypergraphs. 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_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-76796-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76795-4
Online ISBN: 978-3-540-76796-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)