{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:33Z","timestamp":1781305053971,"version":"3.54.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_7","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:41Z","timestamp":1781303681000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["O(log n)-Approximation Algorithms for\u00a0Bipartiteness Ratio"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-2487","authenticated-orcid":false,"given":"Tasuku","family":"Soma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8474-4910","authenticated-orcid":false,"given":"Mingquan","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8919-8479","authenticated-orcid":false,"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Alon, N., Charikar, M.S.: Improved approximation for directed cut problems. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 671\u2013680 (2007)","DOI":"10.1145\/1250790.1250888"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: $$O(\\sqrt{\\log n})$$ approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N Alon","year":"1985","unstructured":"Alon, N., Milman, V.: $$\\lambda _1$$, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory Ser. B 38(1), 73\u201388 (1985)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83\u201396 (1986)","journal-title":"Combinatorica"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Andrews, M.: Approximation algorithms for the edge-disjoint paths problem via raecke decompositions. In: Proceedings of the IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS), pp. 277\u2013286 (2010)","DOI":"10.1109\/FOCS.2010.33"},{"issue":"5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/080731049","volume":"39","author":"S Arora","year":"2010","unstructured":"Arora, S., Hazan, E., Kale, S.: $$O(\\sqrt{\\log n})$$-approximation to sparsest cut in $$\\widetilde{O}(n^2)$$ time. SIAM J. Comput. 39(5), 1748\u20131771 (2010)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2837020","volume":"63","author":"S Arora","year":"2016","unstructured":"Arora, S., Kale, S.: A combinatorial, primal-dual approach to semidefinite programs. J. ACM 63(2), 1\u201335 (2016)","journal-title":"J. ACM"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 1\u201337 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111616","volume":"343","author":"FM Atay","year":"2020","unstructured":"Atay, F.M., Liu, S.: Cheeger constants, structural balance, and spectral clustering analysis for signed graphs. Discret. Math. 343(1), 111616 (2020)","journal-title":"Discret. Math."},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"787","DOI":"10.4310\/CAG.2013.v21.n4.a2","volume":"21","author":"F Bauer","year":"2013","unstructured":"Bauer, F., Jost, J.: Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operator. Comm. Anal. Geom. 21(4), 787\u2013845 (2013)","journal-title":"Comm. Anal. Geom."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Gutenberg, M.P., Saranurak, T.: Deterministic decremental reachability, SCC, and shortest paths via directed expanders and congestion balancing. In: Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1123\u20131134 (2020)","DOI":"10.1109\/FOCS46700.2020.00108"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Gutenberg, M.P., Saranurak, T.: Deterministic decremental SSSP and approximate min-cost flow in almost-linear time. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1000\u20131008 (2021)","DOI":"10.1109\/FOCS52979.2021.00100"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Chang, Y.J., Saranurak, T.: Deterministic distributed expander decomposition and routing with applications in distributed derandomization. In: Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 377\u2013388 (2020)","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Directed metrics and directed graph partitioning problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 51\u201360 (2006)","DOI":"10.1145\/1109557.1109564"},{"key":"7_CR15","unstructured":"Chekuri, C.: Lecture notes on topics in graph algorithms. University of Illinois (2024). https:\/\/courses.grainger.illinois.edu\/cs598csc\/fa2024\/Notes\/lec-cut-matching.pdf"},{"key":"7_CR16","unstructured":"Chen, A., Orecchia, L., Tani, E.: Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game. In: 52nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 49\u20131 (2025)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Chen, D., Meierhans, S., Gutenberg, M.P., Saranurak, T.: Parallel and distributed expander decomposition: simple, fast, and near-optimal. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1705\u20131719 (2025)","DOI":"10.1137\/1.9781611978322.53"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. In: Proceedings of the 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2022)","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: Routing in undirected graphs with constant congestion. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 855\u2013874 (2012)","DOI":"10.1145\/2213977.2214054"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: A distanced matching game, decremental APSP in expanders, and faster deterministic algorithms for graph cut problems. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2122\u20132213 (2023)","DOI":"10.1137\/1.9781611977554.ch82"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Gao, Y., Li, J., Nanongkai, D., Peng, R., Saranurak, T.: A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In: Proceedings of the IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1158\u20131167 (2020)","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Khanna, S.: A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 389\u2013400 (2019)","DOI":"10.1145\/3313276.3316320"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Li, S.: A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 233\u2013242 (2012)","DOI":"10.1109\/FOCS.2012.54"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Zhang, R.: A new deterministic algorithm for fully dynamic all-pairs shortest paths. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), pp. 1159\u20131172 (2023)","DOI":"10.1145\/3564246.3585196"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S0895480103426339","volume":"19","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S., Iwata, S.: Bisubmodular function minimization. SIAM J. Discret. Math. 19(4), 1065\u20131073 (2005)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. In: Proceedings of the 25th annual ACM Symposium on Theory of Computing (STOC), pp. 698\u2013707 (1993)","DOI":"10.1145\/167088.167266"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Williamson, D.P.: .879-approximation algorithms for max cut and max 2sat. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 422\u2013431 (1994)","DOI":"10.1145\/195058.195216"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01261321","volume":"16","author":"AV Goldberg","year":"1996","unstructured":"Goldberg, A.V., Karzanov, A.V.: Path problems in skew-symmetric graphs. Combinatorica 16(3), 353\u2013382 (1996)","journal-title":"Combinatorica"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Goranci, G., R\u00e4cke, H., Saranurak, T., Tan, Z.: The expander hierarchy and its applications to dynamic graph algorithms. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2212\u20132228 (2021)","DOI":"10.1137\/1.9781611976465.132"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sinop, A.K.: Lasserre hierarchy, higher eigenvalues, and approximation schemes for quadratic integer programming with PSD objectives. arXiv preprint arXiv:1104.4746 (2011)","DOI":"10.1109\/FOCS.2011.36"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Hershkowitz, D.E., Li, J., Roeyskoe, A., Saranurak, T.: Low-step multi-commodity flow emulators. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pp. 71\u201382 (2024)","DOI":"10.1145\/3618260.3649689"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Hershkowitz, D.E., Tan, Z.: New structures and algorithms for length-constrained expander decompositions. In: Proceedings of the 65th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1634\u20131645 (2024)","DOI":"10.1109\/FOCS61266.2024.00102"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Huebotter, J., Ghaffari, M.: A cut-matching game for constant-hop expanders. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1651\u20131678 (2025)","DOI":"10.1137\/1.9781611978322.51"},{"issue":"4","key":"7_CR34","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2005.10.005","volume":"97","author":"MT Hajiaghayi","year":"2006","unstructured":"Hajiaghayi, M.T., R\u00e4cke, H.: An $$O(n)$$-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4), 156\u2013160 (2006)","journal-title":"Inf. Process. Lett."},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Huang, B., Jiang, S., Song, Z., Tao, R., Zhang, R.: Solving SDP faster: a robust IPM framework and efficient implementation. In: Proceedings of the IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 233\u2013244 (2022)","DOI":"10.1109\/FOCS54457.2022.00029"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Jiang, S., Song, Z., Weinstein, O., Zhang, H.: A faster algorithm for solving general LPs. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 823\u2013832 (2021)","DOI":"10.1145\/3406325.3451058"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Khandekar, R., Rao, S., Vazirani, U.: Graph partitioning using single commodity flows. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 385\u2013390 (2006)","DOI":"10.1145\/1132516.1132574"},{"key":"7_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, vol. 21, 6th edn. Springer, Heidelberg (2018)","edition":"6"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Kwok, T.C., Lau, L.C., Lee, Y.T., Oveis\u00a0Gharan, S., Trevisan, L.: Improved Cheeger\u2019s inequality: analysis of spectral partitioning algorithms through higher order spectral gap. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), pp. 11\u201320 (2013)","DOI":"10.1145\/2488608.2488611"},{"issue":"3","key":"7_CR40","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12(3), 756\u2013769 (2002)","journal-title":"SIAM J. Optim."},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Tung, K.C., Wang, R.: Fast algorithms for directed graph partitioning using flows and reweighted eigenvalues. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 591\u2013624 (2024)","DOI":"10.1137\/1.9781611977912.22"},{"issue":"6","key":"7_CR42","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Long, Y., Saranurak, T.: Near-optimal deterministic vertex-failure connectivity oracles. In: Proceedings of the 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1002\u20131010 (2022)","DOI":"10.1109\/FOCS54457.2022.00098"},{"key":"7_CR44","unstructured":"Louis, A.: Cut-matching games on directed graphs. arXiv preprint arXiv:1010.1047 (2010)"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Nanongkai, D., Saranurak, T.: Dynamic spanning forest with worst-case update time: adaptive, las vegas, and $$O(n^{1\/2-\\varepsilon })$$-time. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1122\u20131129 (2017)","DOI":"10.1145\/3055399.3055447"},{"key":"7_CR46","unstructured":"Neumann, S., Peng, P.: Sublinear-time clustering oracle for signed graphs. In: International Conference on Machine Learning, pp. 16496\u201316528 (2022)"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Orecchia, L., Schulman, L.J., Vazirani, U.V., Vishnoi, N.K.: On partitioning graphs via single commodity flows. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 461\u2013470 (2008)","DOI":"10.1145\/1374376.1374442"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Peng, R.: Approximate undirected maximum flows in $$O (m \\rm polylog(n))$$ time. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1862\u20131867 (2016)","DOI":"10.1137\/1.9781611974331.ch130"},{"key":"7_CR49","unstructured":"Pokharanakar, M.M.: The dual Cheeger-Buser inequality for graphons. arXiv preprint arXiv:2502.15213 (2025)"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H., Shah, C., T\u00e4ubig, H.: Computing cut-based hierarchical decompositions in almost linear time. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 227\u2013238 (2014)","DOI":"10.1137\/1.9781611973402.17"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Saranurak, T., Wang, D.: Expander decomposition and pruning: faster, stronger, and simpler. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2616\u20132635 (2019)","DOI":"10.1137\/1.9781611975482.162"},{"issue":"2","key":"7_CR52","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F Shahrokhi","year":"1990","unstructured":"Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37(2), 318\u2013334 (1990)","journal-title":"J. ACM"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Sherman, J.: Breaking the multicommodity flow barrier for $$O(\\sqrt{\\log n})$$-approximations to sparsest cut. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 363\u2013372 (2009)","DOI":"10.1109\/FOCS.2009.66"},{"issue":"6","key":"7_CR54","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1137\/090773714","volume":"41","author":"L Trevisan","year":"2012","unstructured":"Trevisan, L.: Max cut and the smallest eigenvalue. SIAM J. Comput. 41(6), 1769\u20131786 (2012)","journal-title":"SIAM J. Comput."},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Veldt, N.: Cut-matching games for generalized hypergraph ratio cuts. In: Proceedings of the ACM Web Conference (WWW), pp. 694\u2013704 (2023)","DOI":"10.1145\/3543507.3583539"},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"Xiao, H., Ordozgoiti, B., Gionis, A.: Searching for polarization in signed graphs: a local spectral approach. In: Proceedings of the Web Conference (WWW), pp. 362\u2013372 (2020)","DOI":"10.1145\/3366423.3380121"},{"key":"7_CR57","doi-asserted-by":"crossref","unstructured":"Yoshida, Y.: Nonlinear laplacian for digraphs and its applications to network analysis. In: Proceedings of the 9th ACM International Conference on Web Search and Data Mining (WSDM), pp. 483\u2013492 (2016)","DOI":"10.1145\/2835776.2835785"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:50Z","timestamp":1781303690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}