Mazumder, Rahul; Wang, Haoyue Linear regression with partially mismatched data: local search with theoretical guarantees. (English) Zbl 07662932 Math. Program. 197, No. 2 (B), 1265-1303 (2023). MSC: 90C06 90C27 62J99 PDF BibTeX XML Cite \textit{R. Mazumder} and \textit{H. Wang}, Math. Program. 197, No. 2 (B), 1265--1303 (2023; Zbl 07662932) Full Text: DOI arXiv OpenURL
Alecu, Bogdan; Atminas, Aistis; Lozin, Vadim; Malyshev, Dmitriy Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07661307 Algorithmica 85, No. 3, 642-664 (2023). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{B. Alecu} et al., Algorithmica 85, No. 3, 642--664 (2023; Zbl 07661307) Full Text: DOI OpenURL
Qian, Xinqiang; Guan, Xiucui; Jia, Junhua; Zhang, Qiao; Pardalos, Panos M. Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm. (English) Zbl 07658730 J. Glob. Optim. 85, No. 2, 461-485 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{X. Qian} et al., J. Glob. Optim. 85, No. 2, 461--485 (2023; Zbl 07658730) Full Text: DOI OpenURL
Del Pia, Alberto Sparse PCA on fixed-rank matrices. (English) Zbl 07658248 Math. Program. 198, No. 1 (A), 139-157 (2023). MSC: 90C20 90C26 90C60 68Q25 PDF BibTeX XML Cite \textit{A. Del Pia}, Math. Program. 198, No. 1 (A), 139--157 (2023; Zbl 07658248) Full Text: DOI arXiv OpenURL
Asano, Tetsuo Transportation problem on a graph. (English) Zbl 07642724 Japan J. Ind. Appl. Math. 40, No. 1, 289-302 (2023). MSC: 90C05 90C27 PDF BibTeX XML Cite \textit{T. Asano}, Japan J. Ind. Appl. Math. 40, No. 1, 289--302 (2023; Zbl 07642724) Full Text: DOI OpenURL
Li, Peng; Wang, Aifa Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs. (English) Zbl 07642701 J. Comb. Optim. 45, No. 1, Paper No. 45, 16 p. (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{P. Li} and \textit{A. Wang}, J. Comb. Optim. 45, No. 1, Paper No. 45, 16 p. (2023; Zbl 07642701) Full Text: DOI OpenURL
Ji, Sai; Dong, Yinhong; Du, Donglei; Wang, Dongzhao; Xu, Dachuan Approximation algorithms for the lower bounded correlation clustering problem. (English) Zbl 07638819 J. Comb. Optim. 45, No. 1, Paper No. 43, 19 p. (2023). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{S. Ji} et al., J. Comb. Optim. 45, No. 1, Paper No. 43, 19 p. (2023; Zbl 07638819) Full Text: DOI OpenURL
Ravelo, Santiago Valdés; Fernandes, Cristina G. Complexity and approximability of minimum path-collection exact covers. (English) Zbl 07635991 Theor. Comput. Sci. 942, 21-32 (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. V. Ravelo} and \textit{C. G. Fernandes}, Theor. Comput. Sci. 942, 21--32 (2023; Zbl 07635991) Full Text: DOI OpenURL
Yan, Hao; Liu, Peihai; Lu, Xiwen Vehicle scheduling problems with two agents on a line. (English) Zbl 07622518 J. Comb. Optim. 45, No. 1, Paper No. 10, 18 p. (2023). MSC: 90B35 68W25 PDF BibTeX XML Cite \textit{H. Yan} et al., J. Comb. Optim. 45, No. 1, Paper No. 10, 18 p. (2023; Zbl 07622518) Full Text: DOI OpenURL
Khachay, M. Yu.; Neznakhina, E. D.; Ryzhenko, K. V. Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem. (English. Russian original) Zbl 07661459 Proc. Steklov Inst. Math. 319, Suppl. 1, S140-S155 (2022); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241-258 (2022). MSC: 90C27 90C35 90B06 PDF BibTeX XML Cite \textit{M. Yu. Khachay} et al., Proc. Steklov Inst. Math. 319, S140--S155 (2022; Zbl 07661459); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 28, No. 3, 241--258 (2022) Full Text: DOI OpenURL
Hirvonen, Minna The implication problem for functional dependencies and variants of marginal distribution equivalences. (English) Zbl 07630643 Varzinczak, Ivan (ed.), Foundations of information and knowledge systems. 12th international symposium, FoIKS 2022, Helsinki, Finland, June 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13388, 130-146 (2022). MSC: 68P15 68T27 68T35 68U35 PDF BibTeX XML Cite \textit{M. Hirvonen}, Lect. Notes Comput. Sci. 13388, 130--146 (2022; Zbl 07630643) Full Text: DOI OpenURL
Freund, Anton A mathematical commitment without computational strength. (English) Zbl 07613697 Rev. Symb. Log. 15, No. 4, 880-906 (2022). MSC: 03F30 03F40 03A05 68R10 PDF BibTeX XML Cite \textit{A. Freund}, Rev. Symb. Log. 15, No. 4, 880--906 (2022; Zbl 07613697) Full Text: DOI arXiv OpenURL
Mosheiov, Gur; Oron, Daniel; Shabtay, Dvir On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. (English) Zbl 1501.90030 J. Sched. 25, No. 5, 577-587 (2022). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{G. Mosheiov} et al., J. Sched. 25, No. 5, 577--587 (2022; Zbl 1501.90030) Full Text: DOI OpenURL
Li, Xianyue; Yang, Ruowang; Zhang, Heping; Zhang, Zhao Partial inverse maximum spanning tree problem under the Chebyshev norm. (English) Zbl 07610131 J. Comb. Optim. 44, No. 5, 3331-3350 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{X. Li} et al., J. Comb. Optim. 44, No. 5, 3331--3350 (2022; Zbl 07610131) Full Text: DOI OpenURL
Jia, Junhua; Guan, Xiucui; Zhang, Qiao; Qian, Xinqiang; Pardalos, Panos M. Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector. (English) Zbl 07606091 J. Glob. Optim. 84, No. 3, 715-738 (2022). MSC: 90C35 PDF BibTeX XML Cite \textit{J. Jia} et al., J. Glob. Optim. 84, No. 3, 715--738 (2022; Zbl 07606091) Full Text: DOI OpenURL
Zhang, Long; Zhang, Yuzhong; Bai, Qingguo An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time. (English) Zbl 1503.90052 J. Comb. Optim. 44, No. 4, 2167-2179 (2022). MSC: 90B35 90B05 68W25 PDF BibTeX XML Cite \textit{L. Zhang} et al., J. Comb. Optim. 44, No. 4, 2167--2179 (2022; Zbl 1503.90052) Full Text: DOI OpenURL
van Iersel, Leo; Kole, Sjors; Moulton, Vincent; Nipius, Leonie An algorithm for reconstructing level-2 phylogenetic networks from trinets. (English) Zbl 07581528 Inf. Process. Lett. 178, Article ID 106300, 8 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. van Iersel} et al., Inf. Process. Lett. 178, Article ID 106300, 8 p. (2022; Zbl 07581528) Full Text: DOI arXiv OpenURL
Thi Huyen Chau Nguyen; Grass, Werner; Jansen, Klaus Exact polynomial time algorithm for the response time analysis of harmonic tasks. (English) Zbl 07577718 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 451-465 (2022). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{Thi Huyen Chau Nguyen} et al., Lect. Notes Comput. Sci. 13270, 451--465 (2022; Zbl 07577718) Full Text: DOI OpenURL
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V. Selecting a subset of diverse points based on the squared Euclidean distance. (English) Zbl 1493.62380 Ann. Math. Artif. Intell. 90, No. 7-9, 965-977 (2022). MSC: 62H30 90C09 68W25 PDF BibTeX XML Cite \textit{A. V. Eremeev} et al., Ann. Math. Artif. Intell. 90, No. 7--9, 965--977 (2022; Zbl 1493.62380) Full Text: DOI OpenURL
Sandomirskiy, Fedor; Segal-Halevi, Erel Efficient fair division with minimal sharing. (English) Zbl 1496.90088 Oper. Res. 70, No. 3, 1762-1782 (2022). MSC: 90C29 90C27 90C90 PDF BibTeX XML Cite \textit{F. Sandomirskiy} and \textit{E. Segal-Halevi}, Oper. Res. 70, No. 3, 1762--1782 (2022; Zbl 1496.90088) Full Text: DOI arXiv OpenURL
Mohammad, Salah Uddin; Noor, Md. Shah; Talukder, Md. Rashed An exact enumeration of the unlabeled disconnected posets. (English) Zbl 07566024 J. Integer Seq. 25, No. 5, Article 22.5.4, 14 p. (2022). MSC: 06A07 05A15 11Y55 PDF BibTeX XML Cite \textit{S. U. Mohammad} et al., J. Integer Seq. 25, No. 5, Article 22.5.4, 14 p. (2022; Zbl 07566024) Full Text: Link OpenURL
Brandstädt, Andreas; Mosca, Raffaele Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time. (English) Zbl 1493.05225 Discuss. Math., Graph Theory 42, No. 4, 1139-1162 (2022). MSC: 05C69 05C70 05C85 68R10 68Q25 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discuss. Math., Graph Theory 42, No. 4, 1139--1162 (2022; Zbl 1493.05225) Full Text: DOI OpenURL
Olaosebikan, Sofiat; Manlove, David Super-stability in the student-project allocation problem with ties. (English) Zbl 1495.90160 J. Comb. Optim. 43, No. 5, 1203-1239 (2022). MSC: 90C27 91B32 PDF BibTeX XML Cite \textit{S. Olaosebikan} and \textit{D. Manlove}, J. Comb. Optim. 43, No. 5, 1203--1239 (2022; Zbl 1495.90160) Full Text: DOI OpenURL
Con, Roni; Shpilka, Amir Improved constructions of coding schemes for the binary deletion channel and the Poisson repeat channel. (English) Zbl 1497.94043 IEEE Trans. Inf. Theory 68, No. 5, 2920-2940 (2022). MSC: 94A29 94A40 94B35 PDF BibTeX XML Cite \textit{R. Con} and \textit{A. Shpilka}, IEEE Trans. Inf. Theory 68, No. 5, 2920--2940 (2022; Zbl 1497.94043) Full Text: DOI OpenURL
Aprahamian, Hrayer; El-Amine, Hadi Optimal screening of populations with heterogeneous risk profiles under the availability of multiple tests. (English) Zbl 07549370 INFORMS J. Comput. 34, No. 1, 150-164 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{H. Aprahamian} and \textit{H. El-Amine}, INFORMS J. Comput. 34, No. 1, 150--164 (2022; Zbl 07549370) Full Text: DOI OpenURL
Bouchard, Sébastien; Dieudonné, Yoann; Lamani, Anissa Byzantine gathering in polynomial time. (English) Zbl 1489.68036 Distrib. Comput. 35, No. 3, 235-263 (2022). MSC: 68M14 68M15 68R10 68W40 PDF BibTeX XML Cite \textit{S. Bouchard} et al., Distrib. Comput. 35, No. 3, 235--263 (2022; Zbl 1489.68036) Full Text: DOI Link OpenURL
Chen, You; Li, Xueliang The proper vertex-disconnection of graphs. (English) Zbl 07540237 Theor. Comput. Sci. 923, 167-178 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Chen} and \textit{X. Li}, Theor. Comput. Sci. 923, 167--178 (2022; Zbl 07540237) Full Text: DOI OpenURL
Nakayama, Akira; Anazawa, Tsutomu; Iwaki, Yudai A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix. (English) Zbl 1493.90095 J. Oper. Res. Soc. Japan 65, No. 1, 23-47 (2022). MSC: 90C05 90C35 PDF BibTeX XML Cite \textit{A. Nakayama} et al., J. Oper. Res. Soc. Japan 65, No. 1, 23--47 (2022; Zbl 1493.90095) OpenURL
Gao, Yuan Min-max scheduling of batch or drop-line jobs under agreeable release and processing times. (English) Zbl 1490.90126 Asia-Pac. J. Oper. Res. 39, No. 2, Article ID 2150023, 15 p. (2022). MSC: 90B35 PDF BibTeX XML Cite \textit{Y. Gao}, Asia-Pac. J. Oper. Res. 39, No. 2, Article ID 2150023, 15 p. (2022; Zbl 1490.90126) Full Text: DOI OpenURL
Ren, Junfeng Single machine batch scheduling with non-increasing time slot costs. (English) Zbl 1493.90068 Optim. Lett. 16, No. 6, 1817-1833 (2022). MSC: 90B35 PDF BibTeX XML Cite \textit{J. Ren}, Optim. Lett. 16, No. 6, 1817--1833 (2022; Zbl 1493.90068) Full Text: DOI OpenURL
Cook, Linda; Seymour, Paul Detecting a long even hole. (English) Zbl 1490.05184 Eur. J. Comb. 104, Article ID 103537, 26 p. (2022). MSC: 05C60 05C38 05C12 05C85 PDF BibTeX XML Cite \textit{L. Cook} and \textit{P. Seymour}, Eur. J. Comb. 104, Article ID 103537, 26 p. (2022; Zbl 1490.05184) Full Text: DOI arXiv OpenURL
Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip Faster minimization of tardy processing time on a single machine. (English) Zbl 07517138 Algorithmica 84, No. 5, 1341-1356 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 84, No. 5, 1341--1356 (2022; Zbl 07517138) Full Text: DOI arXiv OpenURL
Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasi-polynomial time. (English) Zbl 07516621 SIAM J. Comput. 51, No. 2, STOC17-152-STOC17-188 (2022). MSC: 68Q25 68Q70 PDF BibTeX XML Cite \textit{C. S. Calude} et al., SIAM J. Comput. 51, No. 2, STOC17--152-STOC17--188 (2022; Zbl 07516621) Full Text: DOI OpenURL
Tu, Jianhua; Zhang, Lei; Du, Junfeng; Lang, Rongling Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree. (English) Zbl 1485.05174 AIMS Math. 7, No. 1, 569-578 (2022). MSC: 05C85 05C05 05C69 PDF BibTeX XML Cite \textit{J. Tu} et al., AIMS Math. 7, No. 1, 569--578 (2022; Zbl 1485.05174) Full Text: DOI arXiv OpenURL
Dai, Yingjun; Foley, Angèle M.; Hoàng, Chính T. Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs. (English) Zbl 1493.68263 Theor. Comput. Sci. 914, 14-22 (2022). Reviewer: Xueliang Li (Tianjin) MSC: 68R10 05C15 05C85 68Q25 PDF BibTeX XML Cite \textit{Y. Dai} et al., Theor. Comput. Sci. 914, 14--22 (2022; Zbl 1493.68263) Full Text: DOI OpenURL
Yuan, Yuan; Lan, Yan; Ding, Ning; Han, Xin A PTAS for non-resumable open shop scheduling with an availability constraint. (English) Zbl 1490.90260 J. Comb. Optim. 43, No. 2, 350-362 (2022). MSC: 90C27 90B35 PDF BibTeX XML Cite \textit{Y. Yuan} et al., J. Comb. Optim. 43, No. 2, 350--362 (2022; Zbl 1490.90260) Full Text: DOI OpenURL
Abbaas, Omar; Ventura, Jose A. A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network. (English) Zbl 1489.90201 Optim. Lett. 16, No. 3, 953-982 (2022). MSC: 90C35 90B85 PDF BibTeX XML Cite \textit{O. Abbaas} and \textit{J. A. Ventura}, Optim. Lett. 16, No. 3, 953--982 (2022; Zbl 1489.90201) Full Text: DOI OpenURL
Kobayashi, Yusuke Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles. (English) Zbl 1489.90158 Math. Program. 192, No. 1-2 (B), 675-702 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{Y. Kobayashi}, Math. Program. 192, No. 1--2 (B), 675--702 (2022; Zbl 1489.90158) Full Text: DOI Link OpenURL
Del Pia, Alberto; Michini, Carla Short simplex paths in lattice polytopes. (English) Zbl 1487.90476 Discrete Comput. Geom. 67, No. 2, 503-524 (2022). MSC: 90C05 52B20 52B05 PDF BibTeX XML Cite \textit{A. Del Pia} and \textit{C. Michini}, Discrete Comput. Geom. 67, No. 2, 503--524 (2022; Zbl 1487.90476) Full Text: DOI arXiv OpenURL
Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 1495.90226 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90C35 90C15 90C27 68Q25 PDF BibTeX XML Cite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 1495.90226) Full Text: DOI OpenURL
Mook, Ethan; Peikert, Chris Lattice (list) decoding near Minkowski’s inequality. (English) Zbl 1489.94178 IEEE Trans. Inf. Theory 68, No. 2, 863-870 (2022). MSC: 94B35 11H06 94B75 11H71 PDF BibTeX XML Cite \textit{E. Mook} and \textit{C. Peikert}, IEEE Trans. Inf. Theory 68, No. 2, 863--870 (2022; Zbl 1489.94178) Full Text: DOI arXiv OpenURL
Nip, Kameng; Shi, Tianning; Wang, Zhenbo Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 1485.90144 J. Comb. Optim. 43, No. 1, 200-225 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{K. Nip} et al., J. Comb. Optim. 43, No. 1, 200--225 (2022; Zbl 1485.90144) Full Text: DOI OpenURL
Nattino, Giovanni; Song, Chi; Lu, Bo Polymatching algorithm in observational studies with multiple treatment groups. (English) Zbl 07464462 Comput. Stat. Data Anal. 167, Article ID 107364, 14 p. (2022). MSC: 62-XX PDF BibTeX XML Cite \textit{G. Nattino} et al., Comput. Stat. Data Anal. 167, Article ID 107364, 14 p. (2022; Zbl 07464462) Full Text: DOI OpenURL
Besner, Manfred Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations. (English) Zbl 1480.91018 Discrete Appl. Math. 309, 85-109 (2022). MSC: 91A12 91A68 PDF BibTeX XML Cite \textit{M. Besner}, Discrete Appl. Math. 309, 85--109 (2022; Zbl 1480.91018) Full Text: DOI Link OpenURL
Manlove, David; Milne, Duncan; Olaosebikan, Sofiat Student-project allocation with preferences over projects: algorithmic and experimental results. (English) Zbl 1483.90140 Discrete Appl. Math. 308, 220-234 (2022). MSC: 90C27 91B32 PDF BibTeX XML Cite \textit{D. Manlove} et al., Discrete Appl. Math. 308, 220--234 (2022; Zbl 1483.90140) Full Text: DOI OpenURL
Mao, Yanwen; Mitra, Aritra; Sundaram, Shreyas; Tabuada, Paulo On the computational complexity of the secure state-reconstruction problem. (English) Zbl 1480.93045 Automatica 136, Article ID 110083, 11 p. (2022). MSC: 93B07 93B70 93C83 93C55 93C05 68Q17 PDF BibTeX XML Cite \textit{Y. Mao} et al., Automatica 136, Article ID 110083, 11 p. (2022; Zbl 1480.93045) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI arXiv OpenURL
Shabtay, Dvir Single-machine scheduling with machine unavailability periods and resource dependent processing times. (English) Zbl 1490.90134 Eur. J. Oper. Res. 296, No. 2, 423-439 (2022). MSC: 90B35 PDF BibTeX XML Cite \textit{D. Shabtay}, Eur. J. Oper. Res. 296, No. 2, 423--439 (2022; Zbl 1490.90134) Full Text: DOI OpenURL
Grohe, Martin; Neuen, Daniel Recent advances on the graph isomorphism problem. (English) Zbl 07620421 Dabrowski, Konrad K. (ed.) et al., Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 470, 187-234 (2021). MSC: 05C60 PDF BibTeX XML Cite \textit{M. Grohe} and \textit{D. Neuen}, Lond. Math. Soc. Lect. Note Ser. 470, 187--234 (2021; Zbl 07620421) Full Text: arXiv Link OpenURL
El Aimani, Laila A new approach for finding low-weight polynomial multiples. (English) Zbl 1492.94096 Yu, Yu (ed.) et al., Information security and cryptology. 17th international conference, Inscrypt 2021, virtual event, August 12–14, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13007, 151-170 (2021). MSC: 94A60 68P25 PDF BibTeX XML Cite \textit{L. El Aimani}, Lect. Notes Comput. Sci. 13007, 151--170 (2021; Zbl 1492.94096) Full Text: DOI OpenURL
Li, Xianyue; Yang, Ruowang; Zhang, Heping; Zhang, Zhao Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm. (English) Zbl 07550539 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 389-399 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{X. Li} et al., Lect. Notes Comput. Sci. 13135, 389--399 (2021; Zbl 07550539) Full Text: DOI OpenURL
Yan, Hao; Lu, Xiwen Routing and scheduling problems with two agents on a line-shaped network. (English) Zbl 07550526 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 214-223 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{H. Yan} and \textit{X. Lu}, Lect. Notes Comput. Sci. 13135, 214--223 (2021; Zbl 07550526) Full Text: DOI OpenURL
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI OpenURL
Alecu, Bogdan; Atminas, Aistis; Lozin, Vadim; Malyshev, Dmitriy Combinatorics and algorithms for quasi-chain graphs. (English) Zbl 07495013 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 49-62 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{B. Alecu} et al., Lect. Notes Comput. Sci. 12757, 49--62 (2021; Zbl 07495013) Full Text: DOI arXiv OpenURL
Badri, Hossein; Bahreini, Tayebeh; Grosu, Daniel A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times. (English) Zbl 07485260 Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{H. Badri} et al., Comput. Oper. Res. 130, Article ID 105238, 10 p. (2021; Zbl 07485260) Full Text: DOI OpenURL
Schaller, David; Geiß, Manuela; Hellmuth, Marc; Stadler, Peter F. Best match graphs with binary trees. (English) Zbl 1480.92153 Martín-Vide, Carlos (ed.) et al., Algorithms for computational biology. 8th international conference, AlCoB 2021, Missoula, MT, USA, June 7–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12715, 82-93 (2021). MSC: 92D15 05C90 PDF BibTeX XML Cite \textit{D. Schaller} et al., Lect. Notes Comput. Sci. 12715, 82--93 (2021; Zbl 1480.92153) Full Text: DOI arXiv OpenURL
Khalife, Sammy Sequence graphs: characterization and counting of admissible elements. (English) Zbl 1479.05231 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 209-221 (2021). MSC: 05C62 05C75 05C85 68Q17 PDF BibTeX XML Cite \textit{S. Khalife}, AIRO Springer Ser. 5, 209--221 (2021; Zbl 1479.05231) Full Text: DOI HAL OpenURL
Pradhan, D.; Pal, Saikat An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph. (English) Zbl 1475.05139 J. Appl. Math. Comput. 66, No. 1-2, 733-747 (2021). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{S. Pal}, J. Appl. Math. Comput. 66, No. 1--2, 733--747 (2021; Zbl 1475.05139) Full Text: DOI OpenURL
Naresh Kumar, H.; Pradhan, D.; Venkatakrishnan, Y. B. Double vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1475.05134 J. Appl. Math. Comput. 66, No. 1-2, 245-262 (2021). MSC: 05C69 68Q25 68Q17 PDF BibTeX XML Cite \textit{H. Naresh Kumar} et al., J. Appl. Math. Comput. 66, No. 1--2, 245--262 (2021; Zbl 1475.05134) Full Text: DOI OpenURL
Drucker, Nir; Gueron, Shay; Kostic, Dusan Fast polynomial inversion for post quantum QC-MDPC cryptography. (English) Zbl 07433319 Inf. Comput. 281, Article ID 104799, 21 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Drucker} et al., Inf. Comput. 281, Article ID 104799, 21 p. (2021; Zbl 07433319) Full Text: DOI OpenURL
Xiong, Wei; Song, Sulin; Lai, Hong-Jian Polynomially determine if a graph is \((s,3)\)-supereulerian. (English) Zbl 1473.05158 Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021). MSC: 05C45 05C85 PDF BibTeX XML Cite \textit{W. Xiong} et al., Discrete Math. 344, No. 12, Article ID 112601, 7 p. (2021; Zbl 1473.05158) Full Text: DOI OpenURL
Aliakbari, Mina; Geunes, Joseph; Sullivan, Kelly M. The single train shortest route problem in a railyard. (English) Zbl 1477.90115 Optim. Lett. 15, No. 8, 2577-2595 (2021). MSC: 90C35 90B06 PDF BibTeX XML Cite \textit{M. Aliakbari} et al., Optim. Lett. 15, No. 8, 2577--2595 (2021; Zbl 1477.90115) Full Text: DOI OpenURL
Kurita, Kazuhiro; Wasa, Kunihiro; Arimura, Hiroki; Uno, Takeaki Efficient enumeration of dominating sets for sparse graphs. (English) Zbl 1472.05073 Discrete Appl. Math. 303, 283-295 (2021). MSC: 05C30 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{K. Kurita} et al., Discrete Appl. Math. 303, 283--295 (2021; Zbl 1472.05073) Full Text: DOI arXiv Link OpenURL
Ophelders, Tim; Lambers, Roel; Spieksma, Frits C. R.; Vredeveld, Tjark A note on equitable Hamiltonian cycles. (English) Zbl 1472.05090 Discrete Appl. Math. 303, 127-136 (2021). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{T. Ophelders} et al., Discrete Appl. Math. 303, 127--136 (2021; Zbl 1472.05090) Full Text: DOI OpenURL
Shmuel, Ori; Cohen, Asaf; Gurewitz, Omer Compute-and-forward in large relaying systems: limitations and asymptotically optimal scheduling. (English) Zbl 1486.94007 IEEE Trans. Inf. Theory 67, No. 9, 6243-6265 (2021). MSC: 94A05 94A40 PDF BibTeX XML Cite \textit{O. Shmuel} et al., IEEE Trans. Inf. Theory 67, No. 9, 6243--6265 (2021; Zbl 1486.94007) Full Text: DOI arXiv OpenURL
Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI OpenURL
Bravyi, Sergey; Maslov, Dmitri Hadamard-free circuits expose the structure of the Clifford group. (English) Zbl 1475.68132 IEEE Trans. Inf. Theory 67, No. 7, 4546-4563 (2021). MSC: 68Q12 81P68 81R05 PDF BibTeX XML Cite \textit{S. Bravyi} and \textit{D. Maslov}, IEEE Trans. Inf. Theory 67, No. 7, 4546--4563 (2021; Zbl 1475.68132) Full Text: DOI arXiv OpenURL
Dereniowski, Dariusz; Jurkiewicz, Marcin On the characteristic graph of a discrete symmetric channel. (English) Zbl 1475.94065 IEEE Trans. Inf. Theory 67, No. 6, Part 2, 3818-3823 (2021). MSC: 94A40 94A24 PDF BibTeX XML Cite \textit{D. Dereniowski} and \textit{M. Jurkiewicz}, IEEE Trans. Inf. Theory 67, No. 6, Part 2, 3818--3823 (2021; Zbl 1475.94065) Full Text: DOI OpenURL
Brandstädt, Andreas; Mosca, Raffaele Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time. (English) Zbl 07373863 Theor. Comput. Sci. 878-879, 11-25 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Theor. Comput. Sci. 878--879, 11--25 (2021; Zbl 07373863) Full Text: DOI arXiv OpenURL
Schaller, David; Lafond, Manuel; Stadler, Peter F.; Wieseke, Nicolas; Hellmuth, Marc Indirect identification of horizontal gene transfer. (English) Zbl 1467.92134 J. Math. Biol. 83, No. 1, Paper No. 10, 73 p. (2021). MSC: 92D10 92D15 05C90 PDF BibTeX XML Cite \textit{D. Schaller} et al., J. Math. Biol. 83, No. 1, Paper No. 10, 73 p. (2021; Zbl 1467.92134) Full Text: DOI arXiv OpenURL
Altschuler, Jason M.; Boix-Adsera, Enric Wasserstein barycenters can be computed in polynomial time in fixed dimension. (English) Zbl 07370561 J. Mach. Learn. Res. 22, Paper No. 44, 19 p. (2021). MSC: 68T05 PDF BibTeX XML Cite \textit{J. M. Altschuler} and \textit{E. Boix-Adsera}, J. Mach. Learn. Res. 22, Paper No. 44, 19 p. (2021; Zbl 07370561) Full Text: arXiv Link OpenURL
Zhou, Xiaoguang; Miao, Cuixia; Hu, Jiaming; Zou, Juan Two uniform machines scheduling with a job-dependent cumulative effect. (Chinese. English summary) Zbl 1474.90172 J. Qufu Norm. Univ., Nat. Sci. 47, No. 1, 30-34 (2021). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{X. Zhou} et al., J. Qufu Norm. Univ., Nat. Sci. 47, No. 1, 30--34 (2021; Zbl 1474.90172) OpenURL
Chudnovsky, Maria; Scott, Alex; Seymour, Paul Detecting a long odd hole. (English) Zbl 1474.05218 Combinatorica 41, No. 1, 1-30 (2021). MSC: 05C38 05C85 PDF BibTeX XML Cite \textit{M. Chudnovsky} et al., Combinatorica 41, No. 1, 1--30 (2021; Zbl 1474.05218) Full Text: DOI arXiv OpenURL
Panda, B. S.; Goyal, Pooja; Pradhan, D. Differentiating-total domination: approximation and hardness results. (English) Zbl 07362190 Theor. Comput. Sci. 876, 45-58 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{B. S. Panda} et al., Theor. Comput. Sci. 876, 45--58 (2021; Zbl 07362190) Full Text: DOI OpenURL
Defant, Colin; Price, Andrew Elvey; Guttmann, Anthony J. Asymptotics of 3-stack-sortable permutations. (English) Zbl 1466.05002 Electron. J. Comb. 28, No. 2, Research Paper P2.49, 29 p. (2021). MSC: 05A05 05A15 05A16 PDF BibTeX XML Cite \textit{C. Defant} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.49, 29 p. (2021; Zbl 1466.05002) Full Text: DOI arXiv OpenURL
Zhang, Xin; Li, Bi Linear arboricity of outer-1-planar graphs. (English) Zbl 1474.05109 J. Oper. Res. Soc. China 9, No. 1, 181-193 (2021). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{X. Zhang} and \textit{B. Li}, J. Oper. Res. Soc. China 9, No. 1, 181--193 (2021; Zbl 1474.05109) Full Text: DOI OpenURL
Adsul, Bharat; Garg, Jugal; Mehta, Ruta; Sohoni, Milind; von Stengel, Bernhard Fast algorithms for rank-1 bimatrix games. (English) Zbl 1470.91066 Oper. Res. 69, No. 2, 613-631 (2021). MSC: 91A68 91A05 91A10 PDF BibTeX XML Cite \textit{B. Adsul} et al., Oper. Res. 69, No. 2, 613--631 (2021; Zbl 1470.91066) Full Text: DOI arXiv OpenURL
Devillers, Raymond; Erofeev, Evgeny; Hujsa, Thomas Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond. (English) Zbl 1464.68236 Koutny, Maciej (ed.) et al., Transactions on Petri Nets and Other Models of Concurrency XV. Berlin: Springer. Lect. Notes Comput. Sci. 12530, 75-100 (2021). MSC: 68Q85 PDF BibTeX XML Cite \textit{R. Devillers} et al., Lect. Notes Comput. Sci. 12530, 75--100 (2021; Zbl 1464.68236) Full Text: DOI arXiv OpenURL
Gharehgozli, Amir; Xu, Chao; Zhang, Wenda High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. (English) Zbl 1487.90102 Eur. J. Oper. Res. 289, No. 2, 495-507 (2021). MSC: 90B06 90B35 90C27 90C35 PDF BibTeX XML Cite \textit{A. Gharehgozli} et al., Eur. J. Oper. Res. 289, No. 2, 495--507 (2021; Zbl 1487.90102) Full Text: DOI OpenURL
Ravelo, Santiago Valdés Minimum constellation covers: hardness, approximability and polynomial cases. (English) Zbl 1468.90114 J. Comb. Optim. 41, No. 3, 603-624 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{S. V. Ravelo}, J. Comb. Optim. 41, No. 3, 603--624 (2021; Zbl 1468.90114) Full Text: DOI OpenURL
Luo, Taibo; Li, Hongmei; Ru, Shaofeng; Tong, Weitian; Xu, Yinfeng Multiple sink location problem in path networks with a combinational objective. (English) Zbl 1466.90089 Optim. Lett. 15, No. 2, 733-755 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{T. Luo} et al., Optim. Lett. 15, No. 2, 733--755 (2021; Zbl 1466.90089) Full Text: DOI OpenURL
Zhang, Binwu; Guan, Xiucui; Pardalos, Panos M.; Wang, Hui; Zhang, Qiao; Liu, Yan; Chen, Shuyi The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm. (English) Zbl 1466.90118 J. Glob. Optim. 79, No. 3, 757-777 (2021). MSC: 90C35 PDF BibTeX XML Cite \textit{B. Zhang} et al., J. Glob. Optim. 79, No. 3, 757--777 (2021; Zbl 1466.90118) Full Text: DOI OpenURL
Panda, B. S.; Priyamvada Injective coloring of some subclasses of bipartite graphs and chordal graphs. (English) Zbl 1460.05066 Discrete Appl. Math. 291, 68-87 (2021). MSC: 05C15 05C85 05C40 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{Priyamvada}, Discrete Appl. Math. 291, 68--87 (2021; Zbl 1460.05066) Full Text: DOI OpenURL
Schaller, David; Geiß, Manuela; Stadler, Peter F.; Hellmuth, Marc Complete characterization of incorrect orthology assignments in best match graphs. (English) Zbl 1460.92149 J. Math. Biol. 82, No. 3, Paper No. 20, 65 p. (2021). MSC: 92D15 05C90 PDF BibTeX XML Cite \textit{D. Schaller} et al., J. Math. Biol. 82, No. 3, Paper No. 20, 65 p. (2021; Zbl 1460.92149) Full Text: DOI arXiv OpenURL
Iwata, Satoru; Kobayashi, Yusuke A weighted linear matroid parity algorithm. (English) Zbl 1459.90181 SIAM J. Comput. 51, No. 2, STOC17-238-STOC17-280 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{S. Iwata} and \textit{Y. Kobayashi}, SIAM J. Comput. 51, No. 2, STOC17--238-STOC17--280 (2021; Zbl 1459.90181) Full Text: DOI OpenURL
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 1458.05189 Theor. Comput. Sci. 858, 49-63 (2021). MSC: 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 858, 49--63 (2021; Zbl 1458.05189) Full Text: DOI arXiv OpenURL
Nguyen, Trung Thanh; Rothe, Jörg Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. (English) Zbl 1457.90073 Theor. Comput. Sci. 858, 35-48 (2021). MSC: 90B35 68W25 68M20 90C05 PDF BibTeX XML Cite \textit{T. T. Nguyen} and \textit{J. Rothe}, Theor. Comput. Sci. 858, 35--48 (2021; Zbl 1457.90073) Full Text: DOI OpenURL
Panda, B. S.; Goyal, Pooja Global total \(k\)-domination: approximation and hardness results. (English) Zbl 1464.68294 Theor. Comput. Sci. 850, 1-19 (2021). MSC: 68R10 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{P. Goyal}, Theor. Comput. Sci. 850, 1--19 (2021; Zbl 1464.68294) Full Text: DOI OpenURL
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos On the fast delivery problem with one or two packages. (English) Zbl 1464.68278 J. Comput. Syst. Sci. 115, 246-263 (2021). MSC: 68R10 68Q25 68T40 90B06 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., J. Comput. Syst. Sci. 115, 246--263 (2021; Zbl 1464.68278) Full Text: DOI OpenURL
Takagi, Tsuyoshi (ed.); Wakayama, Masato (ed.); Tanaka, Keisuke (ed.); Kunihiro, Noboru (ed.); Kimoto, Kazufumi (ed.); Ikematsu, Yasuhiko (ed.) International symposium on mathematics, quantum theory, and cryptography. Proceedings of MQC 2019, Fukuoka, Japan, September 25–27, 2019. (English) Zbl 1457.94002 Mathematics for Industry 33. Singapore: Springer (ISBN 978-981-15-5190-1/hbk; 978-981-15-5193-2/pbk; 978-981-15-5191-8/ebook). xii, 274 p., open access (2021). MSC: 94-06 94A60 00B25 81P68 81P94 PDF BibTeX XML Cite \textit{T. Takagi} (ed.) et al., International symposium on mathematics, quantum theory, and cryptography. Proceedings of MQC 2019, Fukuoka, Japan, September 25--27, 2019. Singapore: Springer (2021; Zbl 1457.94002) Full Text: DOI OpenURL
Kel’manov, A. V.; Mikhaĭlova, L. V.; Ruzankin, P. S.; Khamidullin, S. A. The minimization problem for the sum of weighted convolution differences: the case of a given number of elements in the sum. (Russian. English summary) Zbl 07617051 Sib. Zh. Vychisl. Mat. 23, No. 2, 127-142 (2020). MSC: 90C30 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Sib. Zh. Vychisl. Mat. 23, No. 2, 127--142 (2020; Zbl 07617051) Full Text: DOI MNR OpenURL
Kirchner, Paul; Espitau, Thomas; Fouque, Pierre-Alain Fast reduction of algebraic lattices over cyclotomic fields. (English) Zbl 07614566 Micciancio, Daniele (ed.) et al., Advances in cryptology – CRYPTO 2020. 40th annual international cryptology conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12171, 155-185 (2020). MSC: 94A60 PDF BibTeX XML Cite \textit{P. Kirchner} et al., Lect. Notes Comput. Sci. 12171, 155--185 (2020; Zbl 07614566) Full Text: DOI OpenURL
Kobayashi, Yusuke Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles. (English) Zbl 1503.90114 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 280-293 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{Y. Kobayashi}, Lect. Notes Comput. Sci. 12125, 280--293 (2020; Zbl 1503.90114) Full Text: DOI arXiv OpenURL
Gimadi, Edward; Rykov, Ivan; Tsidulko, Oxana On PTAS for the geometric maximum connected \(k\)-factor problem. (English) Zbl 1477.90083 Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 194-205 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{E. Gimadi} et al., Commun. Comput. Inf. Sci. 1145, 194--205 (2020; Zbl 1477.90083) Full Text: DOI OpenURL
Guo, Zhiwei; Broersma, Hajo; Li, Ruonan; Zhang, Shenggui Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. (English) Zbl 1462.05140 J. Comb. Optim. 40, No. 4, 1008-1019 (2020). MSC: 05C15 05C38 05C45 05C85 PDF BibTeX XML Cite \textit{Z. Guo} et al., J. Comb. Optim. 40, No. 4, 1008--1019 (2020; Zbl 1462.05140) Full Text: DOI OpenURL
Geng, Zhichao; Liu, Jiayu Single machine batch scheduling with two non-disjoint agents and splitable jobs. (English) Zbl 1466.90032 J. Comb. Optim. 40, No. 3, 774-795 (2020). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{Z. Geng} and \textit{J. Liu}, J. Comb. Optim. 40, No. 3, 774--795 (2020; Zbl 1466.90032) Full Text: DOI OpenURL
Gimadi, Edward Kh.; Rykov, Ivan A. On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space. (English) Zbl 1464.90110 Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 85-97 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{I. A. Rykov}, Lect. Notes Comput. Sci. 12095, 85--97 (2020; Zbl 1464.90110) Full Text: DOI OpenURL
Hochbaum, Dorit S.; Rao, Xu A fully polynomial time approximation scheme for the replenishment storage problem. (English) Zbl 07331214 Oper. Res. Lett. 48, No. 6, 835-839 (2020). MSC: 90-XX PDF BibTeX XML Cite \textit{D. S. Hochbaum} and \textit{X. Rao}, Oper. Res. Lett. 48, No. 6, 835--839 (2020; Zbl 07331214) Full Text: DOI arXiv OpenURL
Khandeev, Vladimir; Panasenko, Anna Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem. (English) Zbl 1460.90152 Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 30-35 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{V. Khandeev} and \textit{A. Panasenko}, Commun. Comput. Inf. Sci. 1275, 30--35 (2020; Zbl 1460.90152) Full Text: DOI OpenURL
Zhang, Binwu; Guan, Xiucui; Zhang, Qiao Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm. (English) Zbl 1459.90218 Optim. Lett. 14, No. 8, 2301-2322 (2020). MSC: 90C35 PDF BibTeX XML Cite \textit{B. Zhang} et al., Optim. Lett. 14, No. 8, 2301--2322 (2020; Zbl 1459.90218) Full Text: DOI OpenURL