Abstract
We consider in this paper the budgeted minimum \(s-t\) cut problem. Suppose that we are given a directed graph \(G=(V,A)\) with two distinguished nodes s and t, k non-negative cost functions \(c^1,\ldots ,c^k:A \rightarrow \mathbb {Z}_+\), and \(k-1\) budget bounds \(b_1, \ldots ,b_{k-1}\). The goal is to find a \(s-t\) cut C satisfying the budget constraints \(c^h(C) \leqslant b_h\), for \(h = 1,\ldots ,k-1\), and whose cost \(c^k(C)\) is minimum. In this paper we discuss the linear relaxation of the problem and introduce a strict partial ordering on its solutions. We give a necessary and sufficient condition for which it has an integral optimal minimal (with respect to this ordering) basic solution. We also show that recognizing whether this is the case is NP-hard.











Similar content being viewed by others
References
Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15–26 (2006)
Chestnut, S.R., Zenklusen, R.: Hardness and approximation for network ow interdiction. Networks 69(4), 378–387 (2017)
Ehrgott, M.: Multicriteria Optimization. Springer (2005)
Egervary, E.: On combinatorial properties of matrices (Hungarian). Mat. Lupok 38, 16–28 (1931)
Flake, G., Lawrence, S., Giles, C.L., Coetzee, F.: Self-organization of the web and identification of communities. IEEE Comput. 35, 1 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Garg, N., Vazirani, V.V.: A polyhedron with all s-t cuts as vertices, and adjacency of cuts. Mathematical Programming 70, 17–25 (1995)
Gourves, L., Monnot, J.: On Strong Equilibria in the Max Cut Game. Internet Network Econ. 1, 608–615 (2009)
Grandoni, F., Ravi, R., Singh, M., Zenklusen, R.: New approaches to multi-objective optimization. Math. Program. 146(1–2), 525–554 (2014)
Hayrapetyan, A., Kempe, D., Pál, M., Svitkina, Z.: Unbalanced graph cuts. Proc. ESA 1, 191–202 (2005)
Hong, S., Chung, S.J., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Oper. Res. Lett. 32(3), 233–239 (2004)
Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Working paper (1999)
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79–100 (1988)
Lampis, M.: Minimum Stable Cut and Treewidth. Proceedings of ESA, ICALP, 1–16 (2021)
Levin, A., Woeginger, G.J.: The constrained minimum weight sum of job completion times. Math. Program. 108, 115–126 (2006)
Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16, 236–245 (1984)
Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48–61 (1974)
Papadimitriou, C. H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. Proceedings of FOCS, 86–92 (2000)
Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Math. Program. Stud. 13, 8–16 (1980)
Ravi, R., Goemans, M.: The constrained minimum spanning tree problem. Proceedings of SWAT, 66–75 (1996)
Schaffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56–87 (1991)
Vazirani, V., Yannakakis, M.: Suboptimal cuts: their enumeration, weight, and number. Proceedings of the 19th International Colloquium on Automata, Languages and Programming, 366–377 (1992)
Zhang, P.: A new approximation algorithm for the unbalanced Min s-t Cut problem. Theoretical Computer Science, 658–665 (2016)
Acknowledgements
We would like to thank the Guest editor and the Reviewers for their valuable comments and suggestions, which helped us in improving the quality of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version of this paper appeared in the International Symposium on Combinatorial Optimization (ISCO 2020).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Aissi, H., Mahjoub, A.R. On the minimum \(s-t\) cut problem with budget constraints. Math. Program. 203, 421–442 (2024). https://doi.org/10.1007/s10107-023-01987-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-023-01987-9