Abstract
A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all eulerian edge capacities. We prove that the clutter of odd st-walks of a signed graph is cycling if and only if it does not contain as a minor the clutter of odd circuits of K 5 nor the clutter of lines of the Fano matroid. Corollaries of this result include, of many, the characterization for weakly bipartite signed graphs [5], packing two-commodity paths[7,10], packing T-joins with small |T|, a new result on covering odd circuits of a signed graph, as well as a new result on covering odd circuits and odd T-joins of a signed graft.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cohen, J., Lucchesi, C.: Minimax relations for T-join packing problems. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS 1997), pp. 38–44 (1997)
Edmonds, J., Fulkerson, D.R.: Bottleneck Extrema. J. Combin. Theory Ser. B 8, 299–306 (1970)
Geelen, J.F., Guenin, B.: Packing odd circuits in eulerian graphs. J. Combin. Theory Ser. B 86, 280–295 (2002)
Gerards, A.M.H.: Multicommodity flows and polyhedra. CWI Quart. 6, 281–296 (1993)
Guenin, B.: A characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 83, 112–168 (2001)
Guenin, B.: Integral polyhedra related to even-cycle and even-cut matroids. Math. Oper. Res. 27(4), 693–710 (2002)
Hu, T.C.: Multicommodity network flows. Oper. Res. 11, 344–360 (1963)
Lehman, A.: A solution of the Shannon switching game. Society for Industrial Appl. Math. 12(4), 687–725 (1964)
Lehman, A.: On the width-length inequality. Math. Program. 17(1), 403–417 (1979)
Rothschild, B., Whinston, A.: Feasibility of two-commodity network flows. Oper. Res. 14, 1121–1129 (1966)
Schrijver, A.: A short proof of Guenin’s characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 85, 255–260 (2002)
Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency, pp. 1408–1409. Springer (2003)
Seymour, P.D.: Matroids and multicommodity flows. Europ. J. Combinatorics 2, 257–290 (1981)
Seymour, P.D.: The forbidden minors of binary matrices. J. London Math. Society 2(12), 356–360 (1976)
Seymour, P.D.: The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B 23, 189–222 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Abdi, A., Guenin, B. (2014). The Cycling Property for the Clutter of Odd st-Walks. In: Lee, J., Vygen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham. https://doi.org/10.1007/978-3-319-07557-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-07557-0_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07556-3
Online ISBN: 978-3-319-07557-0
eBook Packages: Computer ScienceComputer Science (R0)