Emirov, Nazar; Song, Guohui; Sun, Qiyu A divide-and-conquer algorithm for distributed optimization on networks. (English) Zbl 07811902 Appl. Comput. Harmon. Anal. 70, Article ID 101623, 19 p. (2024). MSC: 90B10 94A12 94C15 68W15 PDFBibTeX XMLCite \textit{N. Emirov} et al., Appl. Comput. Harmon. Anal. 70, Article ID 101623, 19 p. (2024; Zbl 07811902) Full Text: DOI arXiv
Jardon, C.; Sheppard, B.; Zaveri, V. A motion planning algorithm in a figure eight track. (English) Zbl 07800555 PUMP J. Undergrad. Res. 6, 224-249 (2023). MSC: 55P99 05C85 90C35 05C90 55M30 PDFBibTeX XMLCite \textit{C. Jardon} et al., PUMP J. Undergrad. Res. 6, 224--249 (2023; Zbl 07800555) Full Text: Link
Lin, Yuquan; Lin, Wensong Maximum weight \(t\)-sparse set problem on vector-weighted graphs. (English) Zbl 07792464 RAIRO, Oper. Res. 57, No. 5, 2799-2818 (2023). MSC: 05C22 05C07 05C35 05C85 90C39 PDFBibTeX XMLCite \textit{Y. Lin} and \textit{W. Lin}, RAIRO, Oper. Res. 57, No. 5, 2799--2818 (2023; Zbl 07792464) Full Text: DOI
Callebaut, Hugo; De Boeck, Jérôme; Fortz, Bernard Preprocessing for segment routing optimization. (English) Zbl 07791143 Networks 82, No. 4, 459-478 (2023). MSC: 90Cxx PDFBibTeX XMLCite \textit{H. Callebaut} et al., Networks 82, No. 4, 459--478 (2023; Zbl 07791143) Full Text: DOI
Christiansen, Jeffrey; Dandurand, Brian; Eberhard, Andrew; Oliveira, Fabricio A study of progressive hedging for stochastic integer programming. (English) Zbl 07786393 Comput. Optim. Appl. 86, No. 3, 989-1034 (2023). MSC: 90Cxx 68Q25 68R10 68U05 PDFBibTeX XMLCite \textit{J. Christiansen} et al., Comput. Optim. Appl. 86, No. 3, 989--1034 (2023; Zbl 07786393) Full Text: DOI OA License
Zhou, Xiaotian; Sun, Haoxin; Li, Wei; Zhang, Zhongzhi Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition. (English) Zbl 1527.90247 Theor. Comput. Sci. 980, Article ID 114220, 16 p. (2023). MSC: 90C35 05C50 15A18 68R10 68W25 PDFBibTeX XMLCite \textit{X. Zhou} et al., Theor. Comput. Sci. 980, Article ID 114220, 16 p. (2023; Zbl 1527.90247) Full Text: DOI arXiv
Shao, Jian-Xi; Liang, Ya-Chun; Liao, Chung-Shou Online predictions for online TSP on the line. (English) Zbl 07766095 Int. J. Found. Comput. Sci. 34, No. 7, 825-851 (2023). MSC: 68Wxx 05Cxx 90Cxx PDFBibTeX XMLCite \textit{J.-X. Shao} et al., Int. J. Found. Comput. Sci. 34, No. 7, 825--851 (2023; Zbl 07766095) Full Text: DOI
Sun, Jian; Zhang, Zan-Bo; Chen, Yannan; Han, Deren; Du, Donglei; Zhang, Xiaoyan A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. (English) Zbl 1528.90229 J. Glob. Optim. 87, No. 2-4, 917-937 (2023). MSC: 90C27 68R10 68W20 68W25 90C22 PDFBibTeX XMLCite \textit{J. Sun} et al., J. Glob. Optim. 87, No. 2--4, 917--937 (2023; Zbl 1528.90229) Full Text: DOI
Atserias, Albert; Fijalkow, Joanna Definable ellipsoid method, sums-of-squares proofs, and the graph isomorphism problem. (English) Zbl 1523.68035 SIAM J. Comput. 52, No. 5, 1193-1229 (2023). MSC: 68Q25 03B70 03C13 05C60 90C22 90C25 PDFBibTeX XMLCite \textit{A. Atserias} and \textit{J. Fijalkow}, SIAM J. Comput. 52, No. 5, 1193--1229 (2023; Zbl 1523.68035) Full Text: DOI
Belyi, Alexander; Sobolevsky, Stanislav; Kurbatski, Alexander; Ratti, Carlo Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem. (English) Zbl 1526.05060 Math. Methods Oper. Res. 98, No. 2, 269-297 (2023). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C22 05C85 68T09 68R10 90C35 90C05 90C90 91C20 PDFBibTeX XMLCite \textit{A. Belyi} et al., Math. Methods Oper. Res. 98, No. 2, 269--297 (2023; Zbl 1526.05060) Full Text: DOI arXiv OA License
Sotskov, Y. N. A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring. (English. Russian original) Zbl 1521.90073 Autom. Remote Control 84, No. 2, 167-186 (2023); translation from Avtom. Telemekh. 2023, No. 1, 139-168 (2023). MSC: 90B35 68M20 05C85 PDFBibTeX XMLCite \textit{Y. N. Sotskov}, Autom. Remote Control 84, No. 2, 167--186 (2023; Zbl 1521.90073); translation from Avtom. Telemekh. 2023, No. 1, 139--168 (2023) Full Text: DOI
Bentert, Matthias; Nichterlein, André; Renken, Malte; Zschoche, Philipp Using a geometric lens to find \(k\)-disjoint shortest paths. (English) Zbl 1527.05048 SIAM J. Discrete Math. 37, No. 3, 1674-1703 (2023). Reviewer: K. M. Kathiresan (Sivakasi) MSC: 05C12 05C35 05C38 68Q25 05C85 90C35 PDFBibTeX XMLCite \textit{M. Bentert} et al., SIAM J. Discrete Math. 37, No. 3, 1674--1703 (2023; Zbl 1527.05048) Full Text: DOI arXiv
Gabrovšek, Boštjan; Peperko, Aljoša; Žerovnik, Janez On the 2-rainbow independent domination numbers of some graphs. (English) Zbl 07722446 CEJOR, Cent. Eur. J. Oper. Res. 31, No. 3, 817-831 (2023). MSC: 90Bxx 05C69 05C15 15A80 05C76 05C85 PDFBibTeX XMLCite \textit{B. Gabrovšek} et al., CEJOR, Cent. Eur. J. Oper. Res. 31, No. 3, 817--831 (2023; Zbl 07722446) Full Text: DOI
Trejo-Sánchez, Joel Antonio; Madera-Ramírez, Francisco A.; Fernández-Zepeda, José Alberto; López-Martínez, José Luis; Flores-Lamas, Alejandro A fast approximation algorithm for the maximum 2-packing set problem on planar graphs. (English) Zbl 1527.90243 Optim. Lett. 17, No. 6, 1435-1454 (2023). MSC: 90C35 05C10 PDFBibTeX XMLCite \textit{J. A. Trejo-Sánchez} et al., Optim. Lett. 17, No. 6, 1435--1454 (2023; Zbl 1527.90243) Full Text: DOI
de Castro, Natalia; Garrido-Vizuete, María A.; Robles, Rafael; Villar-Liñán, María Trinidad Minimum gradation in greyscales of graphs. (English) Zbl 1517.05053 Discrete Optim. 48, Part 1, Article ID 100773, 15 p. (2023). MSC: 05C15 68R10 05C85 90C47 PDFBibTeX XMLCite \textit{N. de Castro} et al., Discrete Optim. 48, Part 1, Article ID 100773, 15 p. (2023; Zbl 1517.05053) Full Text: DOI arXiv
Wojciechowski, Piotr; Subramani, K.; Velasquez, Alvaro Reachability in choice networks. (English) Zbl 1527.90245 Discrete Optim. 48, Part 1, Article ID 100761, 16 p. (2023). MSC: 90C35 90B10 90B06 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{P. Wojciechowski} et al., Discrete Optim. 48, Part 1, Article ID 100761, 16 p. (2023; Zbl 1527.90245) Full Text: DOI
Huang, Chien-Chung; Sellier, François Matroid-constrained vertex cover. (English) Zbl 1522.68406 Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023). MSC: 68R10 05B35 05C22 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{F. Sellier}, Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023; Zbl 1522.68406) Full Text: DOI arXiv
Çivril, A. Corrigendum to: “A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem”. (English) Zbl 1512.68206 Theor. Comput. Sci. 963, Article ID 113926, 2 p. (2023). MSC: 68R10 68W25 90C27 PDFBibTeX XMLCite \textit{A. Çivril}, Theor. Comput. Sci. 963, Article ID 113926, 2 p. (2023; Zbl 1512.68206) Full Text: DOI
Zhao, Xueyang; Yan, Binghao; Zhang, Peng New algorithms for a simple measure of network partitioning. (English) Zbl 07679993 Theor. Comput. Sci. 957, Article ID 113846, 15 p. (2023). MSC: 68R10 68W25 90C27 PDFBibTeX XMLCite \textit{X. Zhao} et al., Theor. Comput. Sci. 957, Article ID 113846, 15 p. (2023; Zbl 07679993) Full Text: DOI
Francis, Mathew C.; Jacob, Dalu The lexicographic method for the threshold cover problem. (English) Zbl 1511.05194 Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023). MSC: 05C70 05C85 90C10 68R10 PDFBibTeX XMLCite \textit{M. C. Francis} and \textit{D. Jacob}, Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023; Zbl 1511.05194) Full Text: DOI
An, Phan Thanh; Phu, Hoang Xuan Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves. (English) Zbl 1517.90109 J. Glob. Optim. 85, No. 4, 1037-1063 (2023). MSC: 90C26 65D19 65Y10 68R10 68W25 90C59 PDFBibTeX XMLCite \textit{P. T. An} and \textit{H. X. Phu}, J. Glob. Optim. 85, No. 4, 1037--1063 (2023; Zbl 1517.90109) Full Text: DOI
Cheriyan, J.; Cummings, R.; Dippel, J.; Zhu, J. An improved approximation algorithm for the matching augmentation problem. (English) Zbl 07669653 SIAM J. Discrete Math. 37, No. 1, 163-190 (2023). MSC: 68W25 68R10 90C59 90C27 05C85 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., SIAM J. Discrete Math. 37, No. 1, 163--190 (2023; Zbl 07669653) Full Text: DOI arXiv
Branson, Luke; Sutton, Andrew M. Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. (English) Zbl 1506.68188 Theor. Comput. Sci. 951, Article ID 113719, 23 p. (2023). MSC: 68W50 68Q27 68R10 90C27 PDFBibTeX XMLCite \textit{L. Branson} and \textit{A. M. Sutton}, Theor. Comput. Sci. 951, Article ID 113719, 23 p. (2023; Zbl 1506.68188) Full Text: DOI
Lendl, Stefan; Woeginger, Gerhard; Wulf, Lasse Non-preemptive tree packing. (English) Zbl 1506.68078 Algorithmica 85, No. 3, 783-804 (2023). MSC: 68R10 05C40 05C85 90B35 90C27 PDFBibTeX XMLCite \textit{S. Lendl} et al., Algorithmica 85, No. 3, 783--804 (2023; Zbl 1506.68078) Full Text: DOI
Ataei, Homa; Davoodi, Mansoor The \(p\)-center problem under locational uncertainty of demand points. (English) Zbl 1509.90112 Discrete Optim. 47, Article ID 100759, 12 p. (2023). MSC: 90B80 68R10 68W25 05C85 PDFBibTeX XMLCite \textit{H. Ataei} and \textit{M. Davoodi}, Discrete Optim. 47, Article ID 100759, 12 p. (2023; Zbl 1509.90112) Full Text: DOI
Çivril, A. A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. (English) Zbl 1512.68205 Theor. Comput. Sci. 943, 121-130 (2023); corrigendum ibid. 963, Article ID 113926, 2 p. (2023). MSC: 68R10 68W25 90C27 PDFBibTeX XMLCite \textit{A. Çivril}, Theor. Comput. Sci. 943, 121--130 (2023; Zbl 1512.68205) Full Text: DOI arXiv
Fiorenza, Dario; Gorla, Daniele; Salvo, Ivano Polynomial recognition of vulnerable multi-commodities. (English) Zbl 07609036 Inf. Process. Lett. 179, Article ID 106282, 6 p. (2023). MSC: 90B10 91A10 91A43 PDFBibTeX XMLCite \textit{D. Fiorenza} et al., Inf. Process. Lett. 179, Article ID 106282, 6 p. (2023; Zbl 07609036) Full Text: DOI
Blumenthal, David B.; Bougleux, Sébastien; Dignös, Anton; Gamper, Johann Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching. (English) Zbl 07810768 Inf. Sci. 596, 202-221 (2022). MSC: 68R01 68R10 05C85 90C59 PDFBibTeX XMLCite \textit{D. B. Blumenthal} et al., Inf. Sci. 596, 202--221 (2022; Zbl 07810768) Full Text: DOI
Aigner-Horev, Elad; Segal-Halevi, Erel Envy-free matchings in bipartite graphs and their applications to fair division. (English) Zbl 07805727 Inf. Sci. 587, 164-187 (2022). MSC: 05C70 05C35 05C85 68W25 91B32 90C27 PDFBibTeX XMLCite \textit{E. Aigner-Horev} and \textit{E. Segal-Halevi}, Inf. Sci. 587, 164--187 (2022; Zbl 07805727) Full Text: DOI arXiv
Rosyida, Isnaini; Wiyanti, Dian Tri; Safaatullah, M. Fajar; Narendra, Alfa; Nurhaida An implementation of coloring of non-disjoint union of fuzzy graphs and fuzzy inference systems to coordinate traffic flows in paired intersections. (English) Zbl 1522.05389 Fuzzy Sets Syst. 450, 47-67 (2022). MSC: 05C72 05C15 05C85 05C90 90B06 PDFBibTeX XMLCite \textit{I. Rosyida} et al., Fuzzy Sets Syst. 450, 47--67 (2022; Zbl 1522.05389) Full Text: DOI
Voroshilov, V. V. Complexity of the max cut problem with the minimal domination constraint. (Russian. English summary) Zbl 1506.68086 Diskretn. Anal. Issled. Oper. 29, No. 1, 5-17 (2022). MSC: 68R10 05C22 05C69 68Q25 90C35 PDFBibTeX XMLCite \textit{V. V. Voroshilov}, Diskretn. Anal. Issled. Oper. 29, No. 1, 5--17 (2022; Zbl 1506.68086) Full Text: DOI MNR
Cordone, Roberto; Franchi, Davide; Scozzari, Andrea Cardinality constrained connected balanced partitions of trees under different criteria. (English) Zbl 1507.68226 Discrete Optim. 46, Article ID 100742, 22 p. (2022). MSC: 68R10 05C70 05C85 68Q25 90C35 90C39 PDFBibTeX XMLCite \textit{R. Cordone} et al., Discrete Optim. 46, Article ID 100742, 22 p. (2022; Zbl 1507.68226) Full Text: DOI
Lahiri, Abhiruk; Mukherjee, Joydeep; Subramanian, C. R. On approximating MIS over \(B_1\)-VPG graphs. (English) Zbl 1524.68236 Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250035, 13 p. (2022). MSC: 68R10 05C62 05C69 68W25 68W40 90C27 PDFBibTeX XMLCite \textit{A. Lahiri} et al., Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250035, 13 p. (2022; Zbl 1524.68236) Full Text: DOI
Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao Hitting weighted even cycles in planar graphs. (English) Zbl 1509.05167 SIAM J. Discrete Math. 36, No. 4, 2830-2862 (2022). Reviewer: K. Subramani (Morgantown) MSC: 05C85 05D15 68W25 05C38 05C10 68Q25 90C27 PDFBibTeX XMLCite \textit{A. Göke} et al., SIAM J. Discrete Math. 36, No. 4, 2830--2862 (2022; Zbl 1509.05167) Full Text: DOI arXiv
Zou, Peng; Qingge, Letu; Yang, Qing; Zhu, Binhai Computing a consensus trajectory in a vehicular network. (English) Zbl 1505.90033 J. Comb. Optim. 44, No. 5, 3575-3594 (2022). MSC: 90B10 68Q25 90C35 05C35 68W25 PDFBibTeX XMLCite \textit{P. Zou} et al., J. Comb. Optim. 44, No. 5, 3575--3594 (2022; Zbl 1505.90033) Full Text: DOI
Naderi, Mohammad Javad; Buchanan, Austin; Walteros, Jose L. Worst-case analysis of clique MIPs. (English) Zbl 1504.90131 Math. Program. 195, No. 1-2 (A), 517-551 (2022). MSC: 90C27 90C10 90C57 90C35 68Q25 68Q27 68R10 PDFBibTeX XMLCite \textit{M. J. Naderi} et al., Math. Program. 195, No. 1--2 (A), 517--551 (2022; Zbl 1504.90131) Full Text: DOI
Zhu, Enqiang; Wu, Pu; Shao, Zehui Exact algorithms for counting 3-colorings of graphs. (English) Zbl 1498.05262 Discrete Appl. Math. 322, 74-93 (2022). MSC: 05C85 05C30 05C15 90C39 68Q17 PDFBibTeX XMLCite \textit{E. Zhu} et al., Discrete Appl. Math. 322, 74--93 (2022; Zbl 1498.05262) Full Text: DOI
Araki, Tetsuya; Nakano, Shin-ichi Max-min dispersion on a line. (English) Zbl 1502.90104 J. Comb. Optim. 44, No. 3, 1824-1830 (2022). MSC: 90B80 68R10 90C35 68U05 68W25 PDFBibTeX XMLCite \textit{T. Araki} and \textit{S.-i. Nakano}, J. Comb. Optim. 44, No. 3, 1824--1830 (2022; Zbl 1502.90104) Full Text: DOI
Lima, Carlos V. G. C.; Rautenbach, Dieter; Souza, Uéverton S.; Szwarcfiter, Jayme L. On the computational complexity of the bipartizing matching problem. (English) Zbl 1497.05093 Ann. Oper. Res. 316, No. 2, 1235-1256 (2022). MSC: 05C15 05C10 68Q25 68Q17 05C75 05C70 90C39 PDFBibTeX XMLCite \textit{C. V. G. C. Lima} et al., Ann. Oper. Res. 316, No. 2, 1235--1256 (2022; Zbl 1497.05093) Full Text: DOI arXiv
Mathew, Jasmine; Kumar, K. Reji Non-planarity using cycles. (English) Zbl 1495.05008 Palest. J. Math. 11, No. 2, 575-581 (2022). MSC: 05A05 05C10 05C38 05C62 05C85 90B10 68R10 68W05 PDFBibTeX XMLCite \textit{J. Mathew} and \textit{K. R. Kumar}, Palest. J. Math. 11, No. 2, 575--581 (2022; Zbl 1495.05008) Full Text: Link
Boyd, Sylvia; Cheriyan, Joseph; Cummings, Robert; Grout, Logan; Ibrahimpur, Sharat; Szigeti, Zoltán; Wang, Lu A \(\frac{4}{3} \)-approximation algorithm for the minimum 2-edge connected multisubgraph problem in the half-integral case. (English) Zbl 07572599 SIAM J. Discrete Math. 36, No. 3, 1730-1747 (2022). MSC: 68R10 90C27 90C35 05C40 05C85 PDFBibTeX XMLCite \textit{S. Boyd} et al., SIAM J. Discrete Math. 36, No. 3, 1730--1747 (2022; Zbl 07572599) Full Text: DOI arXiv
Kudelić, Robert Feedback arc set. A history of the problem and algorithms. (English) Zbl 1515.68004 SpringerBriefs in Computer Science. Cham: Springer (ISBN 978-3-031-10514-2/pbk; 978-3-031-10515-9/ebook). xi, 126 p. (2022). Reviewer: K. Subramani (Morgantown) MSC: 68-01 68R10 68W05 68W25 90C10 PDFBibTeX XMLCite \textit{R. Kudelić}, Feedback arc set. A history of the problem and algorithms. Cham: Springer (2022; Zbl 1515.68004) Full Text: DOI
Veldt, Nate; Benson, Austin R.; Kleinberg, Jon Hypergraph cuts with general splitting functions. (English) Zbl 1494.05080 SIAM Rev. 64, No. 3, 650-685 (2022). MSC: 05C65 05C50 68R10 68Q25 90C27 PDFBibTeX XMLCite \textit{N. Veldt} et al., SIAM Rev. 64, No. 3, 650--685 (2022; Zbl 1494.05080) Full Text: DOI arXiv
Ajay, Jammigumpula; Jana, Satyabrata; Roy, Sasanka Collision-free routing problem with restricted L-path. (English) Zbl 1495.90013 Discrete Appl. Math. 319, 71-80 (2022). MSC: 90B06 05C85 68R10 68W25 68Q17 PDFBibTeX XMLCite \textit{J. Ajay} et al., Discrete Appl. Math. 319, 71--80 (2022; Zbl 1495.90013) Full Text: DOI
Mosca, Raffaele New results on independent sets in extensions of \(2K_2\)-free graphs. (English) Zbl 1494.05088 Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022). MSC: 05C69 05C35 05C75 68Q25 90C39 PDFBibTeX XMLCite \textit{R. Mosca}, Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022; Zbl 1494.05088) Full Text: DOI
Pikies, Tytus; Turowski, Krzysztof; Kubale, Marek Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms. (English) Zbl 1493.90067 Artif. Intell. 309, Article ID 103711, 27 p. (2022). MSC: 90B35 68Q17 68W25 90C05 PDFBibTeX XMLCite \textit{T. Pikies} et al., Artif. Intell. 309, Article ID 103711, 27 p. (2022; Zbl 1493.90067) Full Text: DOI
Chen, Li-Hsuan; Hsieh, Sun-Yuan; Hung, Ling-Ju; Klasing, Ralf On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality. (English) Zbl 1492.68103 Algorithmica 84, No. 7, 1993-2027 (2022). MSC: 68R10 05C22 05C69 68Q17 68Q25 68W25 90B80 90C27 PDFBibTeX XMLCite \textit{L.-H. Chen} et al., Algorithmica 84, No. 7, 1993--2027 (2022; Zbl 1492.68103) Full Text: DOI
Huang, Dawei; Pettie, Seth Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers. (English) Zbl 1492.68144 Algorithmica 84, No. 7, 1952-1992 (2022). MSC: 68W25 05C70 05C85 68R10 90C27 PDFBibTeX XMLCite \textit{D. Huang} and \textit{S. Pettie}, Algorithmica 84, No. 7, 1952--1992 (2022; Zbl 1492.68144) Full Text: DOI arXiv
Ghuge, Rohan; Nagarajan, Viswanath Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems. (English) Zbl 1492.68142 Math. Oper. Res. 47, No. 2, 1612-1630 (2022). MSC: 68W25 68R10 90C27 PDFBibTeX XMLCite \textit{R. Ghuge} and \textit{V. Nagarajan}, Math. Oper. Res. 47, No. 2, 1612--1630 (2022; Zbl 1492.68142) Full Text: DOI
Ezra, Tomer; Feldman, Michal; Gravin, Nick; Tang, Zhihao Gavin Prophet matching with general arrivals. (English) Zbl 1492.68146 Math. Oper. Res. 47, No. 2, 878-898 (2022). MSC: 68W27 05C70 60G40 68R10 90C27 PDFBibTeX XMLCite \textit{T. Ezra} et al., Math. Oper. Res. 47, No. 2, 878--898 (2022; Zbl 1492.68146) Full Text: DOI
Kardam, Yogita Singh; Srivastava, Kamal; Jain, Pallavi; Martí, Rafael Scatter search for the minimum leaf spanning tree problem. (English) Zbl 1520.90197 Comput. Oper. Res. 145, Article ID 105858, 13 p. (2022). MSC: 90C35 05C05 05C85 68R10 90C59 PDFBibTeX XMLCite \textit{Y. S. Kardam} et al., Comput. Oper. Res. 145, Article ID 105858, 13 p. (2022; Zbl 1520.90197) Full Text: DOI
Kadivar, Mehdi; Mohammadi, Neda A maximum clique based approximation algorithm for wireless link scheduling under SINR model. (English) Zbl 1492.68106 J. Comput. Syst. Sci. 129, 72-89 (2022). MSC: 68R10 05C69 68W25 90B35 PDFBibTeX XMLCite \textit{M. Kadivar} and \textit{N. Mohammadi}, J. Comput. Syst. Sci. 129, 72--89 (2022; Zbl 1492.68106) Full Text: DOI
Yeh, Hao-Ping; Lu, Wei; Chen, Li-Hsuan; Hung, Ling-Ju; Klasing, Ralf; Hsieh, Sun-Yuan Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs. (English) Zbl 1492.68111 Theor. Comput. Sci. 922, 13-24 (2022). MSC: 68R10 05C12 68Q17 68Q25 68W25 90B80 90C27 PDFBibTeX XMLCite \textit{H.-P. Yeh} et al., Theor. Comput. Sci. 922, 13--24 (2022; Zbl 1492.68111) Full Text: DOI
Gavenčiak, Tomáš; Koutecký, Martin; Knop, Dušan Integer programming in parameterized complexity: five miniatures. (English) Zbl 1510.90185 Discrete Optim. 44, Part 1, Article ID 100596, 33 p. (2022). MSC: 90C10 05C15 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{T. Gavenčiak} et al., Discrete Optim. 44, Part 1, Article ID 100596, 33 p. (2022; Zbl 1510.90185) Full Text: DOI
Abdalla, Pedro; Bandeira, Afonso S. Community detection with a subsampled semidefinite program. (English) Zbl 1493.94010 Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 6, 10 p. (2022). MSC: 94A13 90C22 91D30 PDFBibTeX XMLCite \textit{P. Abdalla} and \textit{A. S. Bandeira}, Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 6, 10 p. (2022; Zbl 1493.94010) Full Text: DOI arXiv
Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs. (English) Zbl 1486.05294 SIAM J. Comput. 51, No. 2, 254-289 (2022). MSC: 05C85 05C10 68R10 90C35 90C27 PDFBibTeX XMLCite \textit{D. Marx} et al., SIAM J. Comput. 51, No. 2, 254--289 (2022; Zbl 1486.05294) Full Text: DOI arXiv
Demange, Marc; Di Fonso, Alessia; Di Stefano, Gabriele; Vittorini, Pierpaolo A graph theoretical approach to the firebreak locating problem. (English) Zbl 1487.68124 Theor. Comput. Sci. 914, 47-72 (2022). MSC: 68Q25 68Q17 68R10 90B80 90C35 PDFBibTeX XMLCite \textit{M. Demange} et al., Theor. Comput. Sci. 914, 47--72 (2022; Zbl 1487.68124) Full Text: DOI arXiv
Takazawa, Kenjiro Excluded \(t\)-factors in bipartite graphs: unified framework for nonbipartite matchings, restricted 2-matchings, and matroids. (English) Zbl 1486.05251 SIAM J. Discrete Math. 36, No. 1, 702-727 (2022). MSC: 05C70 05B35 05C85 68R10 90C27 90C35 PDFBibTeX XMLCite \textit{K. Takazawa}, SIAM J. Discrete Math. 36, No. 1, 702--727 (2022; Zbl 1486.05251) Full Text: DOI
Brown, Jason Maximal intervals of decrease and inflection points for node reliability. (English) Zbl 1485.90028 Discrete Appl. Math. 313, 40-44 (2022). MSC: 90B25 90B10 05C31 05C85 68R10 PDFBibTeX XMLCite \textit{J. Brown}, Discrete Appl. Math. 313, 40--44 (2022; Zbl 1485.90028) Full Text: DOI
Hartmann, Tim A.; Lendl, Stefan; Woeginger, Gerhard J. Continuous facility location on graphs. (English) Zbl 1489.90155 Math. Program. 192, No. 1-2 (B), 207-227 (2022). MSC: 90C27 68Q25 05C85 PDFBibTeX XMLCite \textit{T. A. Hartmann} et al., Math. Program. 192, No. 1--2 (B), 207--227 (2022; Zbl 1489.90155) Full Text: DOI
Chen, Hangdi; Lu, Changhong; Ye, Qingjie Generalized power domination in claw-free regular graphs. (English) Zbl 1485.05133 Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022). MSC: 05C69 90C35 05C85 68R10 05C35 05C90 PDFBibTeX XMLCite \textit{H. Chen} et al., Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022; Zbl 1485.05133) Full Text: DOI arXiv
Jartoux, Bruno; Mustafa, Nabil H. A tight analysis of geometric local search. (English) Zbl 1497.68572 Discrete Comput. Geom. 67, No. 2, 361-379 (2022). MSC: 68W25 68R10 68U05 90C27 PDFBibTeX XMLCite \textit{B. Jartoux} and \textit{N. H. Mustafa}, Discrete Comput. Geom. 67, No. 2, 361--379 (2022; Zbl 1497.68572) Full Text: DOI
Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura A greedy algorithm for the social golfer and the Oberwolfach problem. (English) Zbl 1495.05267 Eur. J. Oper. Res. 300, No. 1, 310-319 (2022). MSC: 05C70 05C38 90B35 90C27 05C85 PDFBibTeX XMLCite \textit{D. Schmand} et al., Eur. J. Oper. Res. 300, No. 1, 310--319 (2022; Zbl 1495.05267) Full Text: DOI arXiv
Chen, Chen; Tong, Hanghang Network connectivity. Concepts, computation, and optimization. (English) Zbl 1481.68006 Synthesis Lectures on Learning, Networks, and Algorithms 28. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-63639-295-0; 978-1-63639-296-7/ebook). xiii, 151 p. (2022). MSC: 68-02 05C40 05C82 68Q25 68R10 68T05 68W25 90B10 90C35 90C59 PDFBibTeX XMLCite \textit{C. Chen} and \textit{H. Tong}, Network connectivity. Concepts, computation, and optimization. San Rafael, CA: Morgan \& Claypool Publishers (2022; Zbl 1481.68006) Full Text: DOI
Bandyapadhyay, Sayan; Inamdar, Tanmay; Pai, Shreyas; Pemmaraju, Sriram V. Near-optimal clustering in the \(k\)-machine model. (English) Zbl 1515.68355 Theor. Comput. Sci. 899, 80-97 (2022). MSC: 68W15 62H30 68R10 68W25 90B80 PDFBibTeX XMLCite \textit{S. Bandyapadhyay} et al., Theor. Comput. Sci. 899, 80--97 (2022; Zbl 1515.68355) Full Text: DOI arXiv
Haag, Roman; Molter, Hendrik; Niedermeier, Rolf; Renken, Malte Feedback edge sets in temporal graphs. (English) Zbl 1479.05338 Discrete Appl. Math. 307, 65-78 (2022). MSC: 05C85 05C70 68Q17 68R10 90C39 PDFBibTeX XMLCite \textit{R. Haag} et al., Discrete Appl. Math. 307, 65--78 (2022; Zbl 1479.05338) Full Text: DOI arXiv
Kerivin, Hervé; Zhao, Jinhua A computational study on the maximum-weight bounded-degree rooted tree problem. (English) Zbl 1510.68079 Appl. Math. Comput. 413, Article ID 126623, 16 p. (2022). MSC: 68R10 68W25 90C27 90C57 PDFBibTeX XMLCite \textit{H. Kerivin} and \textit{J. Zhao}, Appl. Math. Comput. 413, Article ID 126623, 16 p. (2022; Zbl 1510.68079) Full Text: DOI
Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem. (English) Zbl 1487.90632 Eur. J. Oper. Res. 297, No. 1, 27-39 (2022). MSC: 90C35 05C85 05C69 90C27 90C57 91D30 PDFBibTeX XMLCite \textit{Y. Zhou} et al., Eur. J. Oper. Res. 297, No. 1, 27--39 (2022; Zbl 1487.90632) Full Text: DOI
Nutov, Zeev A \(4+\epsilon\) approximation for \(k\)-connected subgraphs. (English) Zbl 1472.68215 J. Comput. Syst. Sci. 123, 64-75 (2022). MSC: 68W25 05C40 68R10 90C27 PDFBibTeX XMLCite \textit{Z. Nutov}, J. Comput. Syst. Sci. 123, 64--75 (2022; Zbl 1472.68215) Full Text: DOI arXiv
Schierreich, Šimon; Suchý, Ondřej Waypoint routing on bounded treewidth graphs. (English) Zbl 1472.68121 Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022). MSC: 68R10 05C85 68Q27 90C27 90C35 PDFBibTeX XMLCite \textit{Š. Schierreich} and \textit{O. Suchý}, Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022; Zbl 1472.68121) Full Text: DOI arXiv
Goenka, Ritesh; Gupta, Eashan; Khyalia, Sushil; Agarwal, Pratyush; Wajid, Mulinti Shaik; Kalyanakrishnan, Shivaram Upper Bounds for All and Max-gain Policy Iteration Algorithms on Deterministic MDPs. arXiv:2211.15602 Preprint, arXiv:2211.15602 [cs.DM] (2022). MSC: 90C40 68Q25 05C35 05C38 BibTeX Cite \textit{R. Goenka} et al., ``Upper Bounds for All and Max-gain Policy Iteration Algorithms on Deterministic MDPs'', Preprint, arXiv:2211.15602 [cs.DM] (2022) Full Text: arXiv OA License
Caoduro, Marco; Sebő, András Packing, Hitting, and Coloring Squares. arXiv:2206.02185 Preprint, arXiv:2206.02185 [cs.CG] (2022). MSC: 52C15 05B40 05C15 05C62 90C27 68W25 68R01 68R10 BibTeX Cite \textit{M. Caoduro} and \textit{A. Sebő}, ``Packing, Hitting, and Coloring Squares'', Preprint, arXiv:2206.02185 [cs.CG] (2022) Full Text: arXiv OA License
Dijkstra, Lukas; Gagarin, Andrei; Zverovich, Vadim Weighted domination models and randomized heuristics. arXiv:2203.00799 Preprint, arXiv:2203.00799 [math.CO] (2022). MSC: 05C69 68W20 05C85 68R10 90B15 90C10 90C35 BibTeX Cite \textit{L. Dijkstra} et al., ``Weighted domination models and randomized heuristics'', Preprint, arXiv:2203.00799 [math.CO] (2022) Full Text: arXiv OA License
Hicks, Illya V.; Brimkov, Boris Tangle bases: revisited. (English) Zbl 07775256 Networks 77, No. 1, 161-172 (2021). MSC: 68R10 05C70 05C85 90C27 90C35 90C39 PDFBibTeX XMLCite \textit{I. V. Hicks} and \textit{B. Brimkov}, Networks 77, No. 1, 161--172 (2021; Zbl 07775256) Full Text: DOI
de Freitas, Rosiane; Dias, Bruno; Maculan, Nelson; Szwarcfiter, Jayme On distance graph coloring problems. (English) Zbl 07768634 Int. Trans. Oper. Res. 28, No. 3, 1213-1241 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{R. de Freitas} et al., Int. Trans. Oper. Res. 28, No. 3, 1213--1241 (2021; Zbl 07768634) Full Text: DOI
Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao Hitting weighted even cycles in planar graphs. (English) Zbl 1528.68290 Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 25, 23 p. (2021). MSC: 68R10 05C10 05C22 05C38 05C85 68W25 90C27 PDFBibTeX XMLCite \textit{A. Göke} et al., LIPIcs -- Leibniz Int. Proc. Inform. 207, Article 25, 23 p. (2021; Zbl 1528.68290) Full Text: DOI
Atkinson, Timothy; Plump, Detlef; Stepney, Susan Evolving graphs with semantic neutral drift. (English) Zbl 07735478 Nat. Comput. 20, No. 1, 127-143 (2021). MSC: 68T20 68Q07 68R10 68W50 90C59 PDFBibTeX XMLCite \textit{T. Atkinson} et al., Nat. Comput. 20, No. 1, 127--143 (2021; Zbl 07735478) Full Text: DOI arXiv
Bhattacharya, Anushree; Pal, Madhumangal Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs. (English) Zbl 1498.05256 Soft Comput. 25, No. 10, 7095-7118 (2021). MSC: 05C85 05C90 05C72 05C69 90C35 90C70 PDFBibTeX XMLCite \textit{A. Bhattacharya} and \textit{M. Pal}, Soft Comput. 25, No. 10, 7095--7118 (2021; Zbl 1498.05256) Full Text: DOI
Goodrich, Timothy D.; Horton, Eric; Sullivan, Blair D. An updated experimental evaluation of graph bipartization methods. (English) Zbl 1499.68271 ACM J. Exp. Algorithm. 26, Paper No. 12, 24 p. (2021). MSC: 68R10 05C70 05C85 68Q12 90C35 PDFBibTeX XMLCite \textit{T. D. Goodrich} et al., ACM J. Exp. Algorithm. 26, Paper No. 12, 24 p. (2021; Zbl 1499.68271) Full Text: DOI arXiv
Baharev, Ali; Schichl, Hermann; Neumaier, Arnold; Achterberg, Tobias An exact method for the minimum feedback arc set problem. (English) Zbl 1499.68247 ACM J. Exp. Algorithm. 26, Paper No. 1.4, 28 p. (2021). MSC: 68R10 05C30 05C38 05C85 90C35 PDFBibTeX XMLCite \textit{A. Baharev} et al., ACM J. Exp. Algorithm. 26, Paper No. 1.4, 28 p. (2021; Zbl 1499.68247) Full Text: DOI
Duginov, Oleg Ivanovich A weighted perfect matching with constraints on weights of its parts. (Russian. English summary) Zbl 1496.05141 Diskretn. Anal. Issled. Oper. 28, No. 3, 5-37 (2021). MSC: 05C70 68Q25 68R10 90C27 PDFBibTeX XMLCite \textit{O. I. Duginov}, Diskretn. Anal. Issled. Oper. 28, No. 3, 5--37 (2021; Zbl 1496.05141) Full Text: DOI MNR
Hong, Yi; Luo, Chuanwen; Chen, Zhibo; Wang, Xiyun; Li, Xiao Maximizing energy efficiency for charger scheduling of WRSNs. (English) Zbl 1498.68039 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 111-122 (2021). MSC: 68M18 68M20 68Q17 68R10 68W05 90C27 PDFBibTeX XMLCite \textit{Y. Hong} et al., Lect. Notes Comput. Sci. 13153, 111--122 (2021; Zbl 1498.68039) Full Text: DOI
Zazai, M. Fawad; Fügenschuh, Armin R. Computing the trajectories for the development of optimal routes. (English) Zbl 1486.90202 Optim. Eng. 22, No. 2, 975-999 (2021). MSC: 90C35 68R10 68U05 90B90 05C85 PDFBibTeX XMLCite \textit{M. F. Zazai} and \textit{A. R. Fügenschuh}, Optim. Eng. 22, No. 2, 975--999 (2021; Zbl 1486.90202) Full Text: DOI
Zakharov, P. A.; Shabanov, D. A. On the maximal cut in a random hypergraph. (English. Russian original) Zbl 1486.05283 Dokl. Math. 104, No. 3, 336-339 (2021); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 501, 26-30 (2021). MSC: 05C80 05C65 68R10 68W25 90C22 PDFBibTeX XMLCite \textit{P. A. Zakharov} and \textit{D. A. Shabanov}, Dokl. Math. 104, No. 3, 336--339 (2021; Zbl 1486.05283); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 501, 26--30 (2021) Full Text: DOI
Wagner, Dorothea; Wolf, Matthias The complexity of flow expansion and electrical flow expansion. (English) Zbl 1490.90084 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 431-441 (2021). MSC: 90B10 05C21 05C85 68Q17 68W40 90C35 94C15 PDFBibTeX XMLCite \textit{D. Wagner} and \textit{M. Wolf}, Lect. Notes Comput. Sci. 12607, 431--441 (2021; Zbl 1490.90084) Full Text: DOI Link
Wu, Xinyun; Xiong, Caiquan; Deng, Na; Xia, Dahai A variable depth neighborhood search algorithm for the min-max arc crossing problem. (English) Zbl 1511.90414 Comput. Oper. Res. 134, Article ID 105403, 17 p. (2021). MSC: 90C35 05C85 68R10 90C59 PDFBibTeX XMLCite \textit{X. Wu} et al., Comput. Oper. Res. 134, Article ID 105403, 17 p. (2021; Zbl 1511.90414) Full Text: DOI
Sahli, Abderrahim; Carlier, Jacques; Moukrim, Aziz Polynomial algorithms for some scheduling problems with one nonrenewable resource. (English) Zbl 1483.90058 RAIRO, Oper. Res. 55, No. 6, 3493-3511 (2021). MSC: 90B35 05C85 PDFBibTeX XMLCite \textit{A. Sahli} et al., RAIRO, Oper. Res. 55, No. 6, 3493--3511 (2021; Zbl 1483.90058) Full Text: DOI
Masumura, Yuya; Oki, Taihei; Yamaguchi, Yutaro Dynamic programming approach to the generalized minimum Manhattan network problem. (English) Zbl 1515.90118 Algorithmica 83, No. 12, 3681-3714 (2021). MSC: 90C27 68R10 68U05 68W05 90C39 PDFBibTeX XMLCite \textit{Y. Masumura} et al., Algorithmica 83, No. 12, 3681--3714 (2021; Zbl 1515.90118) Full Text: DOI arXiv
Chang, Kung-Ching; Shao, Sihong; Zhang, Dong; Zhang, Weixi Lovász extension and graph cut. (English) Zbl 1490.90291 Commun. Math. Sci. 19, No. 3, 761-786 (2021). Reviewer: Roman Čada (Plzeň) MSC: 90C35 05C85 58E05 90C27 PDFBibTeX XMLCite \textit{K.-C. Chang} et al., Commun. Math. Sci. 19, No. 3, 761--786 (2021; Zbl 1490.90291) Full Text: DOI arXiv
Kubicka, Ewa; Kubicki, Grzegorz; Małafiejski, Michał; Ocetkiewicz, Krzysztof M. Total chromatic sum for trees. (English) Zbl 1479.05111 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, 27-37 (2021). MSC: 05C15 05C05 05C35 05C75 05C85 05C90 90B10 PDFBibTeX XMLCite \textit{E. Kubicka} et al., AIRO Springer Ser. 5, 27--37 (2021; Zbl 1479.05111) Full Text: DOI
Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100 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, 15-26 (2021). MSC: 05C15 05C70 05C85 05C90 90B10 90B15 90C27 90C35 PDFBibTeX XMLCite \textit{J. Díaz} et al., AIRO Springer Ser. 5, 15--26 (2021; Zbl 1479.05100) Full Text: DOI arXiv
Hochstättler, Winfried; Wiehe, Johanna The chromatic polynomial of a digraph. (English) Zbl 1479.05163 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, 1-14 (2021). MSC: 05C31 05C15 05C85 05C90 90B10 90B15 90C27 90C35 PDFBibTeX XMLCite \textit{W. Hochstättler} and \textit{J. Wiehe}, AIRO Springer Ser. 5, 1--14 (2021; Zbl 1479.05163) Full Text: DOI arXiv
Chrobak, Marek; Costello, Kevin P.; Gąsieniec, Leszek Information gathering in ad-hoc radio networks. (English) Zbl 1518.68020 Inf. Comput. 281, Article ID 104769, 16 p. (2021). MSC: 68M10 68M12 68R10 68W15 90B18 PDFBibTeX XMLCite \textit{M. Chrobak} et al., Inf. Comput. 281, Article ID 104769, 16 p. (2021; Zbl 1518.68020) Full Text: DOI arXiv
Hu, Rong; Zhang, Binru A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs. (English) Zbl 1477.68269 J. Math. 2021, Article ID 6115451, 12 p. (2021). MSC: 68T05 68P27 68R10 68W15 68W27 90C25 PDFBibTeX XMLCite \textit{R. Hu} and \textit{B. Zhang}, J. Math. 2021, Article ID 6115451, 12 p. (2021; Zbl 1477.68269) Full Text: DOI
Madarasi, Péter Matchings under distance constraints. I. (English) Zbl 07422385 Ann. Oper. Res. 305, No. 1-2, 137-161 (2021). MSC: 68R10 05C70 68W25 90C59 PDFBibTeX XMLCite \textit{P. Madarasi}, Ann. Oper. Res. 305, No. 1--2, 137--161 (2021; Zbl 07422385) Full Text: DOI
Valizadeh, Mohammad; Tadayon, Mohammad Hesam Complexity and approximability of the marking problem. (English) Zbl 1524.68244 J. Math. Ext. 15, No. 1, 41-60 (2021). MSC: 68R10 05C20 05C22 68Q17 68Q25 90C35 PDFBibTeX XMLCite \textit{M. Valizadeh} and \textit{M. H. Tadayon}, J. Math. Ext. 15, No. 1, 41--60 (2021; Zbl 1524.68244) Full Text: Link
van Leeuwen, Tristan; Aravkin, Aleksandr Y. Variable projection for nonsmooth problems. (English) Zbl 1490.65124 SIAM J. Sci. Comput. 43, No. 5, S249-S268 (2021). MSC: 65K10 49M37 49M41 68Q25 68R10 68U05 90C52 PDFBibTeX XMLCite \textit{T. van Leeuwen} and \textit{A. Y. Aravkin}, SIAM J. Sci. Comput. 43, No. 5, S249--S268 (2021; Zbl 1490.65124) Full Text: DOI
O’Donnell, Ryan; Schramm, Tselil Sherali-Adams strikes back. (English) Zbl 1528.68317 Theory Comput. 17, Paper No. 9, 30 p. (2021). MSC: 68R10 05C50 05C80 68Q25 90C05 90C27 90C35 PDFBibTeX XMLCite \textit{R. O'Donnell} and \textit{T. Schramm}, Theory Comput. 17, Paper No. 9, 30 p. (2021; Zbl 1528.68317) Full Text: DOI arXiv
Deng, Yunyun; Guo, Longkun; Liao, Kewen; Chen, Yi On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms. (English) Zbl 1514.68207 Theor. Comput. Sci. 886, 157-168 (2021). MSC: 68R10 05C38 05C85 68Q17 68W40 90C05 90C35 PDFBibTeX XMLCite \textit{Y. Deng} et al., Theor. Comput. Sci. 886, 157--168 (2021; Zbl 1514.68207) Full Text: DOI
Agarwal, Saurav; Akella, Srinivas Approximation algorithms for the single robot line coverage problem. (English) Zbl 1469.68119 Lavalle, Steven M. (ed.) et al., Algorithmic foundations of robotics XIV. Proceedings of the fourteenth workshop on the algorithmic foundations of robotics. Cham: Springer. Springer Proc. Adv. Robot. 17, 534-550 (2021). MSC: 68T40 68R10 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{S. Agarwal} and \textit{S. Akella}, Springer Proc. Adv. Robot. 17, 534--550 (2021; Zbl 1469.68119) Full Text: DOI