Steiner Cut Dominants

References

• [1] Balas E (2018) Disjunctive Programming (Springer, Cham, Switzerland).Crossref, Google Scholar
• [2] Barahona F, Mahjoub AR (1986) On the cut polytope. Math. Programming 36(2):157–173.Crossref, Google Scholar
• [3] Carr RD, Konjevod G, Little G, Natarajan V, Parekh O (2009) Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms 5(3):27.Crossref, Google Scholar
• [4] Chen L, Kyng R, Liu YP, Peng R, Gutenberg MP, Sachdeva S (2022) Maximum flow and minimum-cost flow in almost-linear time. 2022 IEEE 63rd Annual Sympos. Foundations Comput. Sci. (FOCS) (IEEE, Piscataway, NJ), 612–623.Google Scholar
• [5] Conforti M, Fiorini S, Pashkovich K (2016) Cut dominants and forbidden minors. SIAM J. Discrete Math. 30(3):1571–1589.Crossref, Google Scholar
• [6] Cornuéjols G, Fonlupt J, Naddef D (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33(1):1–27.Crossref, Google Scholar
• [7] Ding M, Li J (2023) Deterministic minimum Steiner cut in maximum flow time. Preprint, submitted December 27, https://arxiv.org/abs/2312.16415.Google Scholar
• [8] Fleischmann B (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21(3):307–317.Crossref, Google Scholar
• [9] Goemans MX (1995) Worst-case comparison of valid inequalities for the TSP. Math. Programming 69(1995):335–349.Crossref, Google Scholar
• [10] Grossi R (2016) Enumeration of paths, cycles, and spanning trees. Kao MY, ed. Encyclopedia of Algorithms (Springer, New York), 640–645.Crossref, Google Scholar
• [11] Jue S, Klein PN (2019) A near-linear time minimum Steiner cut algorithm for planar graphs. Preprint, submitted December 31, https://arxiv.org/abs/1912.11103.Google Scholar
• [12] Lau LC, Ravi R, Singh M (2011) Iterative Methods in Combinatorial Optimization, Cambridge Texts in Applied Mathematics (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [13] Letchford AN, Nasiri SD, Theis DO (2013) Compact formulations of the Steiner traveling salesman problem and related problems. Eur. J. Oper. Res. 228(1):83–92.Crossref, Google Scholar
• [14] Li J, Panigrahi D (2020) Deterministic min-cut in poly-logarithmic max-flows. 2020 IEEE 61st Annual Sympos. Foundations Comput. Sci. (FOCS) (IEEE, Piscataway, NJ), 85–92.Google Scholar
• [15] Li J, Panigrahi D (2022) Deterministic min-cut in poly-logarithmic max-flows. Preprint, submitted May 28, https://arxiv.org/abs/2111.02008.Google Scholar
• [16] Schrijver A (1986) Theory of Linear and Integer Programming (John Wiley & Sons, Chichester, UK).Google Scholar
• [17] Skutella M, Weber A (2010) On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency. Math. Programming 124(1–2):441–454.Crossref, Google Scholar
• [18] Whitney H (1931) Non-separable and planar graphs. Proc. Natl. Acad. Sci. USA 17(2):125–127.Crossref, Google Scholar