Clinch, Katie; Wood, Tony A.; Manzie, Chris Auction algorithm sensitivity for multi-robot task allocation. (English) Zbl 07766493 Automatica 158, Article ID 111239, 10 p. (2023). MSC: 93-XX PDF BibTeX XML Cite \textit{K. Clinch} et al., Automatica 158, Article ID 111239, 10 p. (2023; Zbl 07766493) Full Text: DOI arXiv
Hertrich, Christoph; Sering, Leon ReLU neural networks of polynomial size for exact maximum flow computation. (English) Zbl 07763016 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 187-202 (2023). MSC: 90C10 90C27 PDF BibTeX XML Cite \textit{C. Hertrich} and \textit{L. Sering}, Lect. Notes Comput. Sci. 13904, 187--202 (2023; Zbl 07763016) Full Text: DOI arXiv
Kardam, Yogita Singh; Srivastava, Kamal; Martí, Rafael General variable neighborhood search for the minimum stretch spanning tree problem. (English) Zbl 07762288 Optim. Lett. 17, No. 9, 2005-2031 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{Y. S. Kardam} et al., Optim. Lett. 17, No. 9, 2005--2031 (2023; Zbl 07762288) Full Text: DOI
Gimadi, E. Kh.; Shtepa, A. A. On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter. (English. Russian original) Zbl 07760877 Autom. Remote Control 84, No. 7, 772-787 (2023); translation from Avtom. Telemekh. 2023, No. 7, 146-166 (2023). MSC: 05C22 05C05 68W25 05C85 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} and \textit{A. A. Shtepa}, Autom. Remote Control 84, No. 7, 772--787 (2023; Zbl 07760877); translation from Avtom. Telemekh. 2023, No. 7, 146--166 (2023) Full Text: DOI
Reed, Bruce; Stein, Maya Spanning trees in graphs of high minimum degree with a universal vertex. II: A tight result. (English) Zbl 07747427 J. Graph Theory 102, No. 4, 797-821 (2023). MSC: 05C07 05C35 05C05 PDF BibTeX XML Cite \textit{B. Reed} and \textit{M. Stein}, J. Graph Theory 102, No. 4, 797--821 (2023; Zbl 07747427) Full Text: DOI arXiv
Reed, Bruce; Stein, Maya Spanning trees in graphs of high minimum degree with a universal vertex. I: An asymptotic result. (English) Zbl 07747425 J. Graph Theory 102, No. 4, 737-783 (2023). MSC: 05C07 05C35 05C05 PDF BibTeX XML Cite \textit{B. Reed} and \textit{M. Stein}, J. Graph Theory 102, No. 4, 737--783 (2023; Zbl 07747425) Full Text: DOI arXiv
Carvalho, Iago A.; Coco, Amadeu A. On solving bi-objective constrained minimum spanning tree problems. (English) Zbl 07721400 J. Glob. Optim. 87, No. 1, 301-323 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{I. A. Carvalho} and \textit{A. A. Coco}, J. Glob. Optim. 87, No. 1, 301--323 (2023; Zbl 07721400) Full Text: DOI
Lorenzo-Freire, S.; González-Maestro, A.; Alonso-Meijide, J. M. Algorithms for computing the folk rule in minimum cost spanning tree problems with groups. (English) Zbl 1520.91035 Discrete Appl. Math. 338, 113-124 (2023). MSC: 91A12 91A20 PDF BibTeX XML Cite \textit{S. Lorenzo-Freire} et al., Discrete Appl. Math. 338, 113--124 (2023; Zbl 1520.91035) Full Text: DOI
Labbé, Martine; Landete, Mercedes; Leal, Marina Dendrograms, minimum spanning trees and feature selection. (English) Zbl 07709189 Eur. J. Oper. Res. 308, No. 2, 555-567 (2023). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Labbé} et al., Eur. J. Oper. Res. 308, No. 2, 555--567 (2023; Zbl 07709189) Full Text: DOI
Hernández, Penélope; Peris, Josep E.; Vidal-Puga, Juan A non-cooperative approach to the folk rule in minimum cost spanning tree problems. (English) Zbl 07706821 Eur. J. Oper. Res. 307, No. 2, 922-928 (2023). MSC: 90Bxx PDF BibTeX XML Cite \textit{P. Hernández} et al., Eur. J. Oper. Res. 307, No. 2, 922--928 (2023; Zbl 07706821) Full Text: DOI
Eppstein, David A stronger lower bound on parametric minimum spanning trees. (English) Zbl 07691820 Algorithmica 85, No. 6, 1738-1753 (2023). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{D. Eppstein}, Algorithmica 85, No. 6, 1738--1753 (2023; Zbl 07691820) Full Text: DOI
Klamroth, Kathrin; Stiglmayr, Michael; Sudhoff, Julia Multi-objective matroid optimization with ordinal weights. (English) Zbl 1519.90222 Discrete Appl. Math. 335, 104-119 (2023). MSC: 90C29 90C27 PDF BibTeX XML Cite \textit{K. Klamroth} et al., Discrete Appl. Math. 335, 104--119 (2023; Zbl 1519.90222) Full Text: DOI arXiv
Fischer, Orr; Oshman, Rotem A distributed algorithm for directed minimum-weight spanning tree. (English) Zbl 07662948 Distrib. Comput. 36, No. 1, 57-87 (2023). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{O. Fischer} and \textit{R. Oshman}, Distrib. Comput. 36, No. 1, 57--87 (2023; Zbl 07662948) Full Text: DOI
Trudeau, Christian Minimum cost spanning tree problems as value sharing problems. (English) Zbl 1508.91028 Int. J. Game Theory 52, No. 1, 253-272 (2023). MSC: 91A12 PDF BibTeX XML Cite \textit{C. Trudeau}, Int. J. Game Theory 52, No. 1, 253--272 (2023; Zbl 1508.91028) Full Text: DOI
Jia, Junhua; Guan, Xiucui; Wang, Hui; Zhang, Binwu; Pardalos, Panos M. Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm. (English) Zbl 1502.90149 J. Comput. Appl. Math. 419, Article ID 114754, 17 p. (2023). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{J. Jia} et al., J. Comput. Appl. Math. 419, Article ID 114754, 17 p. (2023; Zbl 1502.90149) Full Text: DOI
Amorosi, Lavinia; Puerto, Justo Two-phase strategies for the bi-objective minimum spanning tree problem. (English) Zbl 07772021 Int. Trans. Oper. Res. 29, No. 6, 3435-3463 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{L. Amorosi} and \textit{J. Puerto}, Int. Trans. Oper. Res. 29, No. 6, 3435--3463 (2022; Zbl 07772021) Full Text: DOI OA License
Chen, Hao; Small, Dylan S. New multivariate tests for assessing covariate balance in matched observational studies. (English) Zbl 1520.62160 Biometrics 78, No. 1, 202-213 (2022). MSC: 62P10 PDF BibTeX XML Cite \textit{H. Chen} and \textit{D. S. Small}, Biometrics 78, No. 1, 202--213 (2022; Zbl 1520.62160) Full Text: DOI arXiv
Janson, Svante; Sorkin, Gregory B. Successive minimum spanning trees. (English) Zbl 07749541 Random Struct. Algorithms 61, No. 1, 126-172 (2022). MSC: 05C05 05D40 05C22 60C05 PDF BibTeX XML Cite \textit{S. Janson} and \textit{G. B. Sorkin}, Random Struct. Algorithms 61, No. 1, 126--172 (2022; Zbl 07749541) Full Text: DOI
Gao, Jie; Goswami, Mayank; Karthik, C. S.; Tsai, Meng-Tsung; Tsai, Shih-Yu; Yang, Hao-Tsung Obtaining approximately optimal and diverse solutions via dispersion. (English) Zbl 07719347 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 222-239 (2022). MSC: 68Qxx 68Rxx 68Wxx PDF BibTeX XML Cite \textit{J. Gao} et al., Lect. Notes Comput. Sci. 13568, 222--239 (2022; Zbl 07719347) Full Text: DOI arXiv
Engelke, Sebastian; Volgushev, Stanislav Structure learning for extremal tree models. (English) Zbl 07686607 J. R. Stat. Soc., Ser. B, Stat. Methodol. 84, No. 5, 2055-2087 (2022). MSC: 62-XX PDF BibTeX XML Cite \textit{S. Engelke} and \textit{S. Volgushev}, J. R. Stat. Soc., Ser. B, Stat. Methodol. 84, No. 5, 2055--2087 (2022; Zbl 07686607) Full Text: DOI arXiv
Yao, Pei; Guo, Longkun Exact algorithms for finding constrained minimum spanning trees. (English) Zbl 1502.90185 J. Comb. Optim. 44, No. 3, 2085-2103 (2022). MSC: 90C35 PDF BibTeX XML Cite \textit{P. Yao} and \textit{L. Guo}, J. Comb. Optim. 44, No. 3, 2085--2103 (2022; Zbl 1502.90185) Full Text: DOI
Petrov, Evgeniy Minimum spanning paths and Hausdorff distance in finite ultrametric spaces. (English) Zbl 1503.54017 \(p\)-Adic Numbers Ultrametric Anal. Appl. 14, No. 2, 145-156 (2022). Reviewer: Shou Lin (Ningde) MSC: 54E35 54E99 05C05 05C62 PDF BibTeX XML Cite \textit{E. Petrov}, \(p\)-Adic Numbers Ultrametric Anal. Appl. 14, No. 2, 145--156 (2022; Zbl 1503.54017) Full Text: DOI
Segal, Michael; Tzfaty, Oren Finding bounded diameter minimum spanning tree in general graphs. (English) Zbl 1520.90203 Comput. Oper. Res. 144, Article ID 105822, 9 p. (2022). MSC: 90C35 05C05 68R10 PDF BibTeX XML Cite \textit{M. Segal} and \textit{O. Tzfaty}, Comput. Oper. Res. 144, Article ID 105822, 9 p. (2022; Zbl 1520.90203) Full Text: DOI
Lu, Yongliang; Benlic, Una; Wu, Qinghua A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. (English) Zbl 1520.90180 Comput. Oper. Res. 144, Article ID 105799, 15 p. (2022). MSC: 90C27 90B18 90C35 90C59 PDF BibTeX XML Cite \textit{Y. Lu} et al., Comput. Oper. Res. 144, Article ID 105799, 15 p. (2022; Zbl 1520.90180) Full Text: DOI
Smirnov, Alexander V. Spanning tree of a multiple graph. (English) Zbl 1492.90156 J. Comb. Optim. 43, No. 4, 850-869 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{A. V. Smirnov}, J. Comb. Optim. 43, No. 4, 850--869 (2022; Zbl 1492.90156) Full Text: DOI
Bergantiños, Gustavo; Chun, Youngsub; Lee, Eunju; Lorenzo, Leticia The folk rule for minimum cost spanning tree problems with multiple sources. (English) Zbl 1489.91021 Int. Game Theory Rev. 24, No. 1, Article ID 2150007, 36 p. (2022). MSC: 91A20 91A12 PDF BibTeX XML Cite \textit{G. Bergantiños} et al., Int. Game Theory Rev. 24, No. 1, Article ID 2150007, 36 p. (2022; Zbl 1489.91021) Full Text: DOI
Augustine, John; Gilbert, Seth; Kuhn, Fabian; Robinson, Peter; Sourav, Suman Latency, capacity, and distributed minimum spanning trees. (English) Zbl 1483.68248 J. Comput. Syst. Sci. 126, 1-20 (2022). MSC: 68R10 68M14 PDF BibTeX XML Cite \textit{J. Augustine} et al., J. Comput. Syst. Sci. 126, 1--20 (2022; Zbl 1483.68248) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Multiple-edge-fault-tolerant approximate shortest-path trees. (English) Zbl 1518.68248 Algorithmica 84, No. 1, 37-59 (2022). MSC: 68R10 05C85 68M15 68P05 68W40 PDF BibTeX XML Cite \textit{D. Bilò} et al., Algorithmica 84, No. 1, 37--59 (2022; Zbl 1518.68248) Full Text: DOI Link
Hougaard, Jens Leth; Tvede, Mich Trouble comes in threes: core stability in minimum cost connection networks. (English) Zbl 1487.91018 Eur. J. Oper. Res. 297, No. 1, 319-324 (2022). MSC: 91A43 90B10 91A12 91B32 PDF BibTeX XML Cite \textit{J. L. Hougaard} and \textit{M. Tvede}, Eur. J. Oper. Res. 297, No. 1, 319--324 (2022; Zbl 1487.91018) Full Text: DOI Link
Contreras-Bolton, Carlos; Parada, Víctor An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search. (English) Zbl 07768633 Int. Trans. Oper. Res. 28, No. 3, 1190-1212 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{C. Contreras-Bolton} and \textit{V. Parada}, Int. Trans. Oper. Res. 28, No. 3, 1190--1212 (2021; Zbl 07768633) Full Text: DOI
Labbé, Martine; Pozo, Miguel A.; Puerto, Justo Computational comparisons of different formulations for the Stackelberg minimum spanning tree game. (English) Zbl 07768498 Int. Trans. Oper. Res. 28, No. 1, 48-69 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{M. Labbé} et al., Int. Trans. Oper. Res. 28, No. 1, 48--69 (2021; Zbl 07768498) Full Text: DOI
Nowicki, Krzysztof A deterministic algorithm for the MST problem in constant rounds of congested clique. (English) Zbl 07765239 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1154-1165 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Nowicki}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 1154--1165 (2021; Zbl 07765239) Full Text: DOI arXiv
Smirnov, A. V. NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity \(k \geqslant 3\). (Russian. English summary) Zbl 1504.68077 Model. Anal. Inf. Sist. 28, No. 1, 22-37 (2021). MSC: 68Q17 68R10 PDF BibTeX XML Cite \textit{A. V. Smirnov}, Model. Anal. Inf. Sist. 28, No. 1, 22--37 (2021; Zbl 1504.68077) Full Text: DOI MNR
Dan, Surajit; Majumder, Saibal; Kar, Mohuya B.; Kar, Samarjit On type-2 fuzzy weighted minimum spanning tree. (English) Zbl 1498.05228 Soft Comput. 25, No. 23, 14873-14892 (2021). MSC: 05C72 05C35 05C05 PDF BibTeX XML Cite \textit{S. Dan} et al., Soft Comput. 25, No. 23, 14873--14892 (2021; Zbl 1498.05228) Full Text: DOI
Athanasopoulos, Georgios-Spyridon Emerging spanning trees in the work of Candilis-Josic-Woods. (English) Zbl 1497.00020 Nexus Netw. J. 23, No. 1, 121-134 (2021). MSC: 00A67 05C05 PDF BibTeX XML Cite \textit{G.-S. Athanasopoulos}, Nexus Netw. J. 23, No. 1, 121--134 (2021; Zbl 1497.00020) Full Text: DOI
Palancı, O.; Alparslan Gök, S. Z.; Weber, Gerhard-Wilhelm On the grey obligation rules. (English) Zbl 1500.91007 Pinto, Alberto (ed.) et al., Modeling, dynamics, optimization and bioeconomics IV. Selected papers based on the presentations at the 6th international conference on dynamics games and science 2018 (DGS-VI-2018) and the 19th Jornadas Latinoamericanas de teora económica (Jolate-XIX). Madrid, Spain, May 2018, and ICABR, Berkeley, USA, May–June 2017. Selected contributions. Cham: Springer. Springer Proc. Math. Stat. 365, 369-380 (2021). MSC: 91A12 91A86 PDF BibTeX XML Cite \textit{O. Palancı} et al., Springer Proc. Math. Stat. 365, 369--380 (2021; Zbl 1500.91007) Full Text: DOI
Righini, Giovanni Efficient optimization of the Held-Karp lower bound. (English) Zbl 1497.90183 OJMO, Open J. Math. Optim. 2, Article No. 9, 17 p. (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{G. Righini}, OJMO, Open J. Math. Optim. 2, Article No. 9, 17 p. (2021; Zbl 1497.90183) Full Text: DOI
Wei, Ningji; Walteros, Jose L.; Pajouh, Foad Mahdavi Integer programming formulations for minimum spanning tree interdiction. (English) Zbl 07549345 INFORMS J. Comput. 33, No. 4, 1461-1480 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{N. Wei} et al., INFORMS J. Comput. 33, No. 4, 1461--1480 (2021; Zbl 07549345) Full Text: DOI
Zhu, Xiaojun; Tang, Shaojie Exact algorithms for the minimum load spanning tree problem. (English) Zbl 07549343 INFORMS J. Comput. 33, No. 4, 1431-1445 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{X. Zhu} and \textit{S. Tang}, INFORMS J. Comput. 33, No. 4, 1431--1445 (2021; Zbl 07549343) Full Text: DOI
Akitaya, Hugo A.; Biniaz, Ahmad; Bose, Prosenjit; De Carufel, Jean-Lou; Maheshwari, Anil; da Silveira, Luís Fernando Schultz Xavier; Smid, Michiel The minimum moving spanning tree problem. (English) Zbl 07498665 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 15-28 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{H. A. Akitaya} et al., Lect. Notes Comput. Sci. 12808, 15--28 (2021; Zbl 07498665) Full Text: DOI
Gimadi, Edward Kh.; Shevyakov, Aleksandr S.; Shtepa, Alexandr A. On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights. (English) Zbl 1485.05026 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 67-78 (2021). MSC: 05C05 05C12 05C22 05C80 68W25 PDF BibTeX XML Cite \textit{E. Kh. Gimadi} et al., Lect. Notes Comput. Sci. 12755, 67--78 (2021; Zbl 1485.05026) Full Text: DOI
Balcı, Mehmet Ali; Akgüller, Ömer; Can Güzel, Serdar Hierarchies in communities of UK stock market from the perspective of Brexit. (English) Zbl 1521.62255 J. Appl. Stat. 48, No. 13-15, 2607-2625 (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{M. A. Balcı} et al., J. Appl. Stat. 48, No. 13--15, 2607--2625 (2021; Zbl 1521.62255) Full Text: DOI
Ye, Kun; Yao, Biyuan; Yin, Jianhua; Guo, Xinxin; Guo, Jin Research on features of ocean noise based on graph theory. (English) Zbl 1483.76050 J. Nonlinear Convex Anal. 22, No. 10, 2179-2189 (2021). MSC: 76Q05 76M99 86A05 05C90 PDF BibTeX XML Cite \textit{K. Ye} et al., J. Nonlinear Convex Anal. 22, No. 10, 2179--2189 (2021; Zbl 1483.76050) Full Text: Link
Wang, Ke; Zhou, Yulin; Tian, Guichao; Goh, Mark A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria. (English) Zbl 1478.90137 Fuzzy Optim. Decis. Mak. 20, No. 4, 497-528 (2021). MSC: 90C35 90C70 05C72 05C22 90C27 PDF BibTeX XML Cite \textit{K. Wang} et al., Fuzzy Optim. Decis. Mak. 20, No. 4, 497--528 (2021; Zbl 1478.90137) Full Text: DOI
Zheng, Ling; Chao, Fei; Parthaláin, Neil Mac; Zhang, Defu; Shen, Qiang Feature grouping and selection: a graph-based approach. (English) Zbl 1475.62201 Inf. Sci. 546, 1256-1272 (2021). MSC: 62H30 68R10 PDF BibTeX XML Cite \textit{L. Zheng} et al., Inf. Sci. 546, 1256--1272 (2021; Zbl 1475.62201) Full Text: DOI Link
Bandyapadhyay, Sayan; Banik, Aritra; Bhore, Sujoy; Nöllenburg, Martin Geometric planar networks on bichromatic collinear points. (English) Zbl 1514.68198 Theor. Comput. Sci. 895, 124-136 (2021). MSC: 68R10 05C05 05C45 05C62 05C70 68Q25 PDF BibTeX XML Cite \textit{S. Bandyapadhyay} et al., Theor. Comput. Sci. 895, 124--136 (2021; Zbl 1514.68198) Full Text: DOI
Kitamura, Naoki; Kitagawa, Hirotaka; Otachi, Yota; Izumi, Taisuke Low-congestion shortcut and graph parameters. (English) Zbl 07422104 Distrib. Comput. 34, No. 5, 349-365 (2021). MSC: 68R10 68W15 PDF BibTeX XML Cite \textit{N. Kitamura} et al., Distrib. Comput. 34, No. 5, 349--365 (2021; Zbl 07422104) Full Text: DOI arXiv
Bergantiños, Gustavo; Lorenzo, Leticia Cost additive rules in minimum cost spanning tree problems with multiple sources. (English) Zbl 1480.90244 Ann. Oper. Res. 301, No. 1-2, 5-15 (2021). MSC: 90C35 PDF BibTeX XML Cite \textit{G. Bergantiños} and \textit{L. Lorenzo}, Ann. Oper. Res. 301, No. 1--2, 5--15 (2021; Zbl 1480.90244) Full Text: DOI Link
Shi, Feng; Neumann, Frank; Wang, Jianxin Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem. (English) Zbl 1514.68334 Theor. Comput. Sci. 893, 159-175 (2021). MSC: 68W50 68R10 68W40 PDF BibTeX XML Cite \textit{F. Shi} et al., Theor. Comput. Sci. 893, 159--175 (2021; Zbl 1514.68334) Full Text: DOI arXiv
Gitik, Rivka; Bartal, Or; Joskowicz, Leo Euclidean minimum spanning trees with independent and dependent geometric uncertainties. (English) Zbl 1516.68105 Comput. Geom. 96, Article ID 101744, 18 p. (2021). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{R. Gitik} et al., Comput. Geom. 96, Article ID 101744, 18 p. (2021; Zbl 1516.68105) Full Text: DOI
Ganesan, Ghurumuruhan Minimum spanning trees of random geometric graphs with location dependent weights. (English) Zbl 1479.05325 Bernoulli 27, No. 4, 2473-2493 (2021). Reviewer: Xavier Pérez Giménez (Lincoln) MSC: 05C80 05C22 05C05 60D05 60F99 PDF BibTeX XML Cite \textit{G. Ganesan}, Bernoulli 27, No. 4, 2473--2493 (2021; Zbl 1479.05325) Full Text: DOI arXiv
Egawa, Yoshimi; Furuya, Michitaka; Matsumura, Hajime Existence of a spanning tree having small diameter. (English) Zbl 1472.05034 Discrete Math. 344, No. 11, Article ID 112548, 15 p. (2021). MSC: 05C05 05C12 05C35 05C07 PDF BibTeX XML Cite \textit{Y. Egawa} et al., Discrete Math. 344, No. 11, Article ID 112548, 15 p. (2021; Zbl 1472.05034) Full Text: DOI
Mashreghi, Ali; King, Valerie Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model. (English) Zbl 07391414 Distrib. Comput. 34, No. 4, 283-299 (2021). MSC: 68W15 68Q10 68R10 PDF BibTeX XML Cite \textit{A. Mashreghi} and \textit{V. King}, Distrib. Comput. 34, No. 4, 283--299 (2021; Zbl 07391414) Full Text: DOI arXiv
Subiza, Begoña; Peris, Josep E. Sharing the cost of maximum quality optimal spanning trees. (English) Zbl 1471.90048 Top 29, No. 2, 470-493 (2021). MSC: 90B18 90C29 90B50 PDF BibTeX XML Cite \textit{B. Subiza} and \textit{J. E. Peris}, Top 29, No. 2, 470--493 (2021; Zbl 1471.90048) Full Text: DOI Link
Wang, Hui; Guan, Xiucui; Zhang, Qiao; Zhang, Binwu Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. (English) Zbl 1473.90145 J. Comb. Optim. 41, No. 4, 861-887 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Comb. Optim. 41, No. 4, 861--887 (2021; Zbl 1473.90145) Full Text: DOI
Dar, Muhammad Abid; Fischer, Andreas; Martinovic, John; Scheithauer, Guntram Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. (English) Zbl 1506.90257 Discrete Optim. 40, Article ID 100623, 33 p. (2021). MSC: 90C35 05C85 68R10 90C11 PDF BibTeX XML Cite \textit{M. A. Dar} et al., Discrete Optim. 40, Article ID 100623, 33 p. (2021; Zbl 1506.90257) Full Text: DOI
Ahmed, Imtiaz; Hu, Xia Ben; Acharya, Mithun P.; Ding, Yu Neighborhood structure assisted non-negative matrix factorization and its application in unsupervised point-wise anomaly detection. (English) Zbl 07370551 J. Mach. Learn. Res. 22, Paper No. 34, 32 p. (2021). MSC: 68T05 PDF BibTeX XML Cite \textit{I. Ahmed} et al., J. Mach. Learn. Res. 22, Paper No. 34, 32 p. (2021; Zbl 07370551) Full Text: arXiv Link
Tang, Ming; Liao, Huchang; Mi, Xiaomei; Lev, Benjamin; Pedrycz, Witold A hierarchical consensus reaching process for group decision making with noncooperative behaviors. (English) Zbl 1487.91033 Eur. J. Oper. Res. 293, No. 2, 632-642 (2021). MSC: 91B06 PDF BibTeX XML Cite \textit{M. Tang} et al., Eur. J. Oper. Res. 293, No. 2, 632--642 (2021; Zbl 1487.91033) Full Text: DOI
Correia, Pedro; Paquete, Luís; Figueira, José Rui Finding multi-objective supported efficient spanning trees. (English) Zbl 1469.90128 Comput. Optim. Appl. 78, No. 2, 491-528 (2021). MSC: 90C29 90C27 PDF BibTeX XML Cite \textit{P. Correia} et al., Comput. Optim. Appl. 78, No. 2, 491--528 (2021; Zbl 1469.90128) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; Pentangelo, Rosa; Raiconi, Andrea Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. (English) Zbl 1514.90233 Ann. Oper. Res. 298, No. 1-2, 65-78 (2021). MSC: 90C35 90C57 PDF BibTeX XML Cite \textit{F. Carrabs} et al., Ann. Oper. Res. 298, No. 1--2, 65--78 (2021; Zbl 1514.90233) Full Text: DOI
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
Mastakas, Konstantinos Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree. (English) Zbl 1506.68084 Inf. Process. Lett. 166, Article ID 106035, 5 p. (2021). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{K. Mastakas}, Inf. Process. Lett. 166, Article ID 106035, 5 p. (2021; Zbl 1506.68084) Full Text: DOI arXiv
Marzo, Ruslán G.; Ribeiro, Celso C. A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem. (English) Zbl 07767490 Int. Trans. Oper. Res. 27, No. 3, 1419-1446 (2020). MSC: 90-XX PDF BibTeX XML Cite \textit{R. G. Marzo} and \textit{C. C. Ribeiro}, Int. Trans. Oper. Res. 27, No. 3, 1419--1446 (2020; Zbl 07767490) Full Text: DOI
Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. (English) Zbl 07765761 Networks 75, No. 3, 259-277 (2020). MSC: 90Cxx PDF BibTeX XML Cite \textit{J. Baste} et al., Networks 75, No. 3, 259--277 (2020; Zbl 07765761) Full Text: DOI
Hušek, Radek; Knop, Dušan; Masařík, Tomáš Approximation algorithms for Steiner tree based on star contractions: a unified view. (English) Zbl 07764107 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 16, 18 p. (2020). MSC: 68Q25 68Q27 68Wxx PDF BibTeX XML Cite \textit{R. Hušek} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 16, 18 p. (2020; Zbl 07764107) Full Text: DOI arXiv
Focke, Jacob; Megow, Nicole; Meißner, Julie Minimum spanning tree under explorable uncertainty in theory and experiments. (English) Zbl 1521.68097 ACM J. Exp. Algorithm. 25, Paper No. 1.14, 20 p. (2020). MSC: 68R10 PDF BibTeX XML Cite \textit{J. Focke} et al., ACM J. Exp. Algorithm. 25, Paper No. 1.14, 20 p. (2020; Zbl 1521.68097) Full Text: DOI
Gimadi, Edward K.; Shevyakov, Aleksandr S.; Shtepa, Alexandr A. A given diameter MST on a random graph. (English) Zbl 1506.90074 Olenev, Nicholas (ed.) et al., Optimization and applications. 11th international conference, OPTIMA 2020, Moscow, Russia, September 28 – October 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12422, 110-121 (2020). MSC: 90B18 05C05 PDF BibTeX XML Cite \textit{E. K. Gimadi} et al., Lect. Notes Comput. Sci. 12422, 110--121 (2020; Zbl 1506.90074) Full Text: DOI
Thiessen, Maximilian; Quesada, Luis; Brown, Kenneth N. Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH. (English) Zbl 07636036 Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 447-456 (2020). MSC: 68T20 90Bxx 90C27 PDF BibTeX XML Cite \textit{M. Thiessen} et al., Lect. Notes Comput. Sci. 12296, 447--456 (2020; Zbl 07636036) Full Text: DOI
Duan, Ran; He, Haoqing; Zhang, Tianyi Near-linear time algorithm for approximate minimum degree spanning trees. (English) Zbl 07600761 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 15-26 (2020). MSC: 68Qxx 68Rxx 68Wxx PDF BibTeX XML Cite \textit{R. Duan} et al., Lect. Notes Comput. Sci. 12118, 15--26 (2020; Zbl 07600761) Full Text: DOI arXiv
Guzmán-Ponce, A.; Marcial-Romero, J. Raymundo; Valdovinos-Rosas, R. M.; Sánchez-Garreta, J. S. Weighted complete graphs for condensing data. (English) Zbl 07516359 Pozos-Parra, Pilar (ed.) et al., Proceedings of the 11th and 12th Latin American workshop on logic/languages, algorithms and new methods of reasoning, LANMR, Puebla, Mexico, November 15, 2018 and November 15, 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 354, 45-60 (2020). MSC: 68T27 PDF BibTeX XML Cite \textit{A. Guzmán-Ponce} et al., Electron. Notes Theor. Comput. Sci. 354, 45--60 (2020; Zbl 07516359) Full Text: DOI
Zhuang, Ertan; Tan, Zhibin; Bai, Yunfei; Cao, Zhigang Minimum-cost spanning tree games: Bird rule revisited. (Chinese. English summary) Zbl 1499.91005 Sci. Sin., Math. 50, No. 9, 1405-1416 (2020). MSC: 91A12 90C27 PDF BibTeX XML Cite \textit{E. Zhuang} et al., Sci. Sin., Math. 50, No. 9, 1405--1416 (2020; Zbl 1499.91005) Full Text: DOI
Ciupală, Laura; Deaconu, Adrian; Spridon, Delia Incremental minimum spanning tree algorithms. (English) Zbl 1488.90015 Bull. Transilv. Univ. Brașov, Ser. III, Math. Inform. Phys. 13(62), No. 1, 343-346 (2020). MSC: 90B10 90C90 90C35 PDF BibTeX XML Cite \textit{L. Ciupală} et al., Bull. Transilv. Univ. Brașov, Ser. III, Math. Inform. Phys. 13(62), No. 1, 343--346 (2020; Zbl 1488.90015) Full Text: DOI
Kano, Mikio; Matsumura, Hajime Spanning trees with small diameters. (English) Zbl 1511.05038 AKCE Int. J. Graphs Comb. 17, No. 1, 329-334 (2020). MSC: 05C05 05C12 PDF BibTeX XML Cite \textit{M. Kano} and \textit{H. Matsumura}, AKCE Int. J. Graphs Comb. 17, No. 1, 329--334 (2020; Zbl 1511.05038) Full Text: DOI
Zhang, Xinming; Wang, Doudou; Fu, Zihao; Liu, Shangwang; Mao, Wentao; Liu, Guoqi; Jiang, Yun; Li, Shuangqian Novel biogeography-based optimization algorithm with hybrid migration and global-best Gaussian mutation. (English) Zbl 1481.90320 Appl. Math. Modelling 86, 74-91 (2020). MSC: 90C59 68W50 PDF BibTeX XML Cite \textit{X. Zhang} et al., Appl. Math. Modelling 86, 74--91 (2020; Zbl 1481.90320) Full Text: DOI
Zojaji, Masoumeh; Meybodi, Mohammad Reza Mollakhalili; Mirzaie, Kamal A rapid learning automata-based approach for generalized minimum spanning tree problem. (English) Zbl 1466.90094 J. Comb. Optim. 40, No. 3, 636-659 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Zojaji} et al., J. Comb. Optim. 40, No. 3, 636--659 (2020; Zbl 1466.90094) Full Text: DOI
Xie, Jiang; Xiong, Zhong-Yang; Dai, Qi-Zhu; Wang, Xiao-Xia; Zhang, Yu-Fang A new internal index based on density core for clustering validation. (English) Zbl 1456.62121 Inf. Sci. 506, 346-365 (2020). MSC: 62H30 PDF BibTeX XML Cite \textit{J. Xie} et al., Inf. Sci. 506, 346--365 (2020; Zbl 1456.62121) Full Text: DOI
Ivanov, Aleksandr Olegovich; Tuzhilin, Alekseĭ Avgustinovich Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation. (English) Zbl 1459.05358 Chebyshevskiĭ Sb. 21, No. 2(74), 169-189 (2020). MSC: 05E45 05C05 05C35 05C15 90C35 54E35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Chebyshevskiĭ Sb. 21, No. 2(74), 169--189 (2020; Zbl 1459.05358) Full Text: MNR
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
Yin, Li The dynamic Nash bargaining solution for 2-stage cost sharing game. (English) Zbl 1454.91039 Petrosyan, Leon A. (ed.) et al., Contributions to game theory and management. Volume XIII. Collected papers presented at the 13th international conference on game theory and management (GTM 2019), St. Petersburg, Russia, June 27–29, 2018. St. Petersburg: St. Petersburg State University. 296-303 (2020). MSC: 91A25 91A20 91A80 91B26 PDF BibTeX XML Cite \textit{L. Yin}, in: Contributions to game theory and management. Volume XIII. Collected papers presented at the 13th international conference on game theory and management (GTM 2019), St. Petersburg, Russia, June 27--29, 2018. St. Petersburg: St. Petersburg State University. 296--303 (2020; Zbl 1454.91039) Full Text: MNR
Ando, Kazutoshi; Takase, Koichi Monte Carlo algorithm for calculating the Shapley values minimum cost spanning tree games. (English) Zbl 1452.91023 J. Oper. Res. Soc. Japan 63, No. 1, 31-40 (2020). MSC: 91A12 PDF BibTeX XML Cite \textit{K. Ando} and \textit{K. Takase}, J. Oper. Res. Soc. Japan 63, No. 1, 31--40 (2020; Zbl 1452.91023)
Elkin, Michael A simple deterministic distributed MST algorithm with near-optimal time and message complexities. (English) Zbl 1491.68265 J. ACM 67, No. 2, Article No. 13, 15 p. (2020). MSC: 68W15 68R10 68W40 PDF BibTeX XML Cite \textit{M. Elkin}, J. ACM 67, No. 2, Article No. 13, 15 p. (2020; Zbl 1491.68265) Full Text: DOI arXiv
Schweinhart, Benjamin Fractal dimension and the persistent homology of random geometric complexes. (English) Zbl 1450.28007 Adv. Math. 372, Article ID 107291, 58 p. (2020). Reviewer: Peter Massopust (München) MSC: 28A80 55N31 62R40 PDF BibTeX XML Cite \textit{B. Schweinhart}, Adv. Math. 372, Article ID 107291, 58 p. (2020; Zbl 1450.28007) Full Text: DOI arXiv Backlinks: MO
Akitaya, Hugo A.; Löffler, Maarten; Tóth, Csaba D. Multi-colored spanning graphs. (English) Zbl 1451.68197 Theor. Comput. Sci. 833, 11-25 (2020). MSC: 68R10 68Q17 68U05 68W25 68W40 PDF BibTeX XML Cite \textit{H. A. Akitaya} et al., Theor. Comput. Sci. 833, 11--25 (2020; Zbl 1451.68197) Full Text: DOI arXiv
Gokbayrak, Kagan; Avci, Harun A voltage drop limited decentralized electric power distribution network. (English) Zbl 1458.90469 Comput. Oper. Res. 118, Article ID 104907, 17 p. (2020). MSC: 90B85 90C35 PDF BibTeX XML Cite \textit{K. Gokbayrak} and \textit{H. Avci}, Comput. Oper. Res. 118, Article ID 104907, 17 p. (2020; Zbl 1458.90469) Full Text: DOI
Rybarczyk, Katarzyna GHS algorithm on a graph with random weights. (English) Zbl 1443.68215 Theor. Comput. Sci. 828-829, 19-31 (2020). MSC: 68W15 05C80 68R10 68W40 PDF BibTeX XML Cite \textit{K. Rybarczyk}, Theor. Comput. Sci. 828--829, 19--31 (2020; Zbl 1443.68215) Full Text: DOI
Ozeki, Kenta; Wiener, Gábor; Zamfirescu, Carol T. On minimum leaf spanning trees and a criticality notion. (English) Zbl 1440.05062 Discrete Math. 343, No. 7, Article ID 111884, 7 p. (2020). MSC: 05C05 PDF BibTeX XML Cite \textit{K. Ozeki} et al., Discrete Math. 343, No. 7, Article ID 111884, 7 p. (2020; Zbl 1440.05062) Full Text: DOI
Favati, P.; Lotti, G.; Menchi, O.; Romani, F. Construction of the similarity matrix for the spectral clustering method: numerical experiments. (English) Zbl 1432.68383 J. Comput. Appl. Math. 375, Article ID 112795, 11 p. (2020). MSC: 68T05 62H30 PDF BibTeX XML Cite \textit{P. Favati} et al., J. Comput. Appl. Math. 375, Article ID 112795, 11 p. (2020; Zbl 1432.68383) Full Text: DOI arXiv
Sarkar, Soham; Biswas, Rahul; Ghosh, Anil K. On some graph-based two-sample tests for high dimension, low sample size data. (English) Zbl 1446.62150 Mach. Learn. 109, No. 2, 279-306 (2020). MSC: 62H15 62H22 PDF BibTeX XML Cite \textit{S. Sarkar} et al., Mach. Learn. 109, No. 2, 279--306 (2020; Zbl 1446.62150) Full Text: DOI arXiv
Pop, Petrică C. The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances. (English) Zbl 1431.90166 Eur. J. Oper. Res. 283, No. 1, 1-15 (2020). MSC: 90C35 90C27 90C59 90-02 PDF BibTeX XML Cite \textit{P. C. Pop}, Eur. J. Oper. Res. 283, No. 1, 1--15 (2020; Zbl 1431.90166) Full Text: DOI
Kitamura, Naoki; Kitagawa, Hirotaka; Otachi, Yota; Izumi, Taisuke Low-congestion shortcut and graph parameters. (English) Zbl 1515.68375 Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 25, 17 p. (2019). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{N. Kitamura} et al., LIPIcs -- Leibniz Int. Proc. Inform. 146, Article 25, 17 p. (2019; Zbl 1515.68375) Full Text: DOI
Fischer, Orr; Oshman, Rotem A distributed algorithm for directed minimum-weight spanning tree. (English) Zbl 1515.68368 Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 16, 16 p. (2019). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{O. Fischer} and \textit{R. Oshman}, LIPIcs -- Leibniz Int. Proc. Inform. 146, Article 16, 16 p. (2019; Zbl 1515.68368) Full Text: DOI
Merino, Arturo I.; Soto, José A. The minimum cost query problem on matroids with uncertainty areas. (English) Zbl 07561576 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 83, 14 p. (2019). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{A. I. Merino} and \textit{J. A. Soto}, LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 83, 14 p. (2019; Zbl 07561576) Full Text: DOI arXiv
Guimarães, Silvio; Kenmochi, Yukiko; Cousty, Jean; Patrocinio, Zenilton jun.; Najman, Laurent Erratum to: “Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method”. (English) Zbl 1469.68159 Math. Morphol., Theory Appl. 3, 71 (2019). MSC: 68U10 PDF BibTeX XML Cite \textit{S. Guimarães} et al., Math. Morphol., Theory Appl. 3, 71 (2019; Zbl 1469.68159) Full Text: DOI
Pushparaj Shetty, D.; Lakshmi, M. Prasanna Minimizing the maximum sender interference by deploying additional nodes in a wireless sensor network. (English) Zbl 1468.90037 Electron. J. Graph Theory Appl. 7, No. 1, 169-182 (2019). MSC: 90B18 05C85 PDF BibTeX XML Cite \textit{D. Pushparaj Shetty} and \textit{M. P. Lakshmi}, Electron. J. Graph Theory Appl. 7, No. 1, 169--182 (2019; Zbl 1468.90037) Full Text: DOI
Dey, Arindam; Mondal, Sahanur; Pal, Tandra Robust and minimum spanning tree in fuzzy environment. (English) Zbl 1453.90036 Int. J. Comput. Sci. Math. 10, No. 5, 513-524 (2019). MSC: 90B10 05C72 90C70 PDF BibTeX XML Cite \textit{A. Dey} et al., Int. J. Comput. Sci. Math. 10, No. 5, 513--524 (2019; Zbl 1453.90036) Full Text: DOI
Dinitz, Michael; Halldorsson, Magnus M.; Izumi, Taisuke; Newport, Calvin Distributed minimum degree spanning trees. (English) Zbl 07298716 Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 511-520 (2019). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{M. Dinitz} et al., in: Proceedings of the 38th ACM symposium on principles of distributed computing, PODC '19, Toronto, ON, Canada, July 29 -- August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 511--520 (2019; Zbl 07298716) Full Text: DOI
Cerrone, Carmine; Di Placido, Andrea; Russo, Davide Donato A genetic algorithm for minimum conflict weighted spanning tree problem. (English) Zbl 1456.90166 Paolucci, Massimo (ed.) et al., Advances in optimization and decision science for society, services and enterprises. ODS, Genoa, Italy, September 4–7, 2019. Proceedings of the international conference on optimization and decision science. Cham: Springer. AIRO Springer Ser. 3, 445-455 (2019). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{C. Cerrone} et al., AIRO Springer Ser. 3, 445--455 (2019; Zbl 1456.90166) Full Text: DOI
Benabbou, Nawal; Lust, Thibaut An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information. (English) Zbl 1447.90046 Ben Amor, Nahla (ed.) et al., Scalable uncertainty management. 13th international conference, SUM 2019, Compiègne, France, December 16–18, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11940, 221-235 (2019). MSC: 90C27 90C29 PDF BibTeX XML Cite \textit{N. Benabbou} and \textit{T. Lust}, Lect. Notes Comput. Sci. 11940, 221--235 (2019; Zbl 1447.90046) Full Text: DOI Link
Perez-de-la-Cruz, Gonzalo; Eslava-Gomez, Guillermina Discriminant analysis for discrete variables derived from a tree-structured graphical model. (English) Zbl 1474.62242 Adv. Data Anal. Classif., ADAC 13, No. 4, 855-876 (2019). MSC: 62H30 62H22 68T10 PDF BibTeX XML Cite \textit{G. Perez-de-la-Cruz} and \textit{G. Eslava-Gomez}, Adv. Data Anal. Classif., ADAC 13, No. 4, 855--876 (2019; Zbl 1474.62242) Full Text: DOI
Shi, Feng; Neumann, Frank; Wang, Jianxin Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem. (English) Zbl 1433.68652 Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27–29, 2019. New York, NY: Association for Computing Machinery (ACM). 133-146 (2019). MSC: 68W50 68W40 90C59 PDF BibTeX XML Cite \textit{F. Shi} et al., in: Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27--29, 2019. New York, NY: Association for Computing Machinery (ACM). 133--146 (2019; Zbl 1433.68652) Full Text: DOI