Ouzia, Hacene; Maculan, Nelson Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\). (English) Zbl 07513941 J. Glob. Optim. 83, No. 1, 119-136 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{H. Ouzia} and \textit{N. Maculan}, J. Glob. Optim. 83, No. 1, 119--136 (2022; Zbl 07513941) Full Text: DOI OpenURL
Azimi, Ali; Bapat, Ravindra B.; Goel, Shivani Steiner distance matrix of caterpillar graphs. (English) Zbl 07507328 Spec. Matrices 10, 267-284 (2022). MSC: 05C50 05C05 05C12 PDF BibTeX XML Cite \textit{A. Azimi} et al., Spec. Matrices 10, 267--284 (2022; Zbl 07507328) Full Text: DOI OpenURL
Dayrens, François; Masnou, Simon; Novaga, Matteo; Pozzetta, Marco Connected perimeter of planar sets. (English) Zbl 07499995 Adv. Calc. Var. 15, No. 2, 213-234 (2022). MSC: 49J45 49Q15 28A75 49Q20 26A45 49-XX PDF BibTeX XML Cite \textit{F. Dayrens} et al., Adv. Calc. Var. 15, No. 2, 213--234 (2022; Zbl 07499995) Full Text: DOI OpenURL
Sun, Yuefang Extremal results for directed tree connectivity. (English) Zbl 07493944 Bull. Malays. Math. Sci. Soc. (2) 45, No. 2, 839-850 (2022). MSC: 05C05 05C20 05C35 05C40 05C70 05C75 PDF BibTeX XML Cite \textit{Y. Sun}, Bull. Malays. Math. Sci. Soc. (2) 45, No. 2, 839--850 (2022; Zbl 07493944) Full Text: DOI arXiv OpenURL
Ferone, Daniele; Festa, Paola; Guerriero, Francesca The rainbow Steiner tree problem. (English) Zbl 07486437 Comput. Oper. Res. 139, Article ID 105621, 11 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Ferone} et al., Comput. Oper. Res. 139, Article ID 105621, 11 p. (2022; Zbl 07486437) Full Text: DOI OpenURL
Fampa, Marcia Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. (English) Zbl 1483.90134 Discrete Appl. Math. 308, 4-19 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{M. Fampa}, Discrete Appl. Math. 308, 4--19 (2022; Zbl 1483.90134) Full Text: DOI OpenURL
Fukunaga, Takuro; Ravi, R.; Rudenko, Oleksandr; Tang, Ziye Two-level hub Steiner trees. (English) Zbl 07444823 Inf. Process. Lett. 174, Article ID 106209, 6 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. Fukunaga} et al., Inf. Process. Lett. 174, Article ID 106209, 6 p. (2022; Zbl 07444823) Full Text: DOI OpenURL
Zachos, Anastasios N. Generalized regularity and the symmetry of branches of “botanological” networks. (English) Zbl 07498807 KoG 25, 53-63 (2021). MSC: 52A10 51N20 51M20 51E10 52A15 PDF BibTeX XML Cite \textit{A. N. Zachos}, KoG 25, 53--63 (2021; Zbl 07498807) Full Text: DOI OpenURL
Rehfeldt, Daniel; Koch, Thorsten Implications, conflicts, and reductions for Steiner trees. (English) Zbl 1483.90144 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 473-487 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{D. Rehfeldt} and \textit{T. Koch}, Lect. Notes Comput. Sci. 12707, 473--487 (2021; Zbl 1483.90144) Full Text: DOI OpenURL
Stepanova, E. I. Bifurcations of binary types of Steiner minimal networks in the plane. (English. Russian original) Zbl 1479.05335 J. Math. Sci., New York 259, No. 5, 730-747 (2021); translation from Fundam. Prikl. Mat. 22, No. 6, 227-252 (2019). MSC: 05C82 05C10 PDF BibTeX XML Cite \textit{E. I. Stepanova}, J. Math. Sci., New York 259, No. 5, 730--747 (2021; Zbl 1479.05335); translation from Fundam. Prikl. Mat. 22, No. 6, 227--252 (2019) Full Text: DOI OpenURL
Saikia, Parikshit; Karmakar, Sushanta; Pagourtzis, Aris Primal-dual based distributed approximation algorithm for prize-collecting Steiner tree. (English) Zbl 1476.90288 Discrete Math. Algorithms Appl. 13, No. 2, Article ID 2150008, 48 p. (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{P. Saikia} et al., Discrete Math. Algorithms Appl. 13, No. 2, Article ID 2150008, 48 p. (2021; Zbl 1476.90288) Full Text: DOI arXiv OpenURL
Li, Xingfu; Yu, Guihai; Klavžar, Sandi; Hu, Jie; Li, Bo The Steiner \(k\)-eccentricity on trees. (English) Zbl 07407478 Theor. Comput. Sci. 889, 182-188 (2021). Reviewer: Do Ngoc Diep (Hanoi) MSC: 68R10 05C05 05C12 05C38 05C85 PDF BibTeX XML Cite \textit{X. Li} et al., Theor. Comput. Sci. 889, 182--188 (2021; Zbl 07407478) Full Text: DOI arXiv OpenURL
Li, Xingfu; Yu, Guihai; Klavžar, Sandi On the average Steiner 3-eccentricity of trees. (English) Zbl 1479.05084 Discrete Appl. Math. 304, 181-195 (2021). Reviewer: Manoj Changat (Trivandrum) MSC: 05C12 05C05 05C09 PDF BibTeX XML Cite \textit{X. Li} et al., Discrete Appl. Math. 304, 181--195 (2021; Zbl 1479.05084) Full Text: DOI arXiv OpenURL
Li, Shasha \(k\)-tree connectivity of line graphs. (English) Zbl 1473.05151 Discrete Math. 344, No. 12, Article ID 112617, 4 p. (2021). MSC: 05C40 05C05 05C76 PDF BibTeX XML Cite \textit{S. Li}, Discrete Math. 344, No. 12, Article ID 112617, 4 p. (2021; Zbl 1473.05151) Full Text: DOI arXiv OpenURL
Dondl, P.; Novaga, M.; Wojtowytsch, S.; Wolff-Vorbeck, S. Connected Coulomb columns: analysis and numerics. (English) Zbl 1469.49042 Nonlinearity 34, No. 9, 6120-6139 (2021). MSC: 49Q10 28A75 65N99 82D15 PDF BibTeX XML Cite \textit{P. Dondl} et al., Nonlinearity 34, No. 9, 6120--6139 (2021; Zbl 1469.49042) Full Text: DOI arXiv OpenURL
Dankelmann, Peter; Dossou-Olory, Audace A. V. Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence. (English) Zbl 1466.05041 Acta Appl. Math. 171, Paper No. 15, 18 p. (2021). MSC: 05C09 05C05 05C12 05C35 PDF BibTeX XML Cite \textit{P. Dankelmann} and \textit{A. A. V. Dossou-Olory}, Acta Appl. Math. 171, Paper No. 15, 18 p. (2021; Zbl 1466.05041) Full Text: DOI arXiv OpenURL
Zachos, Anastasios N. An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space. (English) Zbl 1465.51007 Analysis, München 41, No. 2, 79-112 (2021). MSC: 51N20 51M20 51E10 52A15 PDF BibTeX XML Cite \textit{A. N. Zachos}, Analysis, München 41, No. 2, 79--112 (2021; Zbl 1465.51007) Full Text: DOI OpenURL
Li, Jianping; Zheng, Yujie; Lichen, Junran; Wang, Wencheng On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\). (English) Zbl 1466.90116 Optim. Lett. 15, No. 2, 669-683 (2021). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. Li} et al., Optim. Lett. 15, No. 2, 669--683 (2021; Zbl 1466.90116) Full Text: DOI OpenURL
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen Travelling on graphs with small highway dimension. (English) Zbl 07335025 Algorithmica 83, No. 5, 1352-1370 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{Y. Disser} et al., Algorithmica 83, No. 5, 1352--1370 (2021; Zbl 07335025) Full Text: DOI arXiv OpenURL
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan Steiner trees for hereditary graph classes: a treewidth perspective. (English) Zbl 1477.68203 Theor. Comput. Sci. 867, 30-39 (2021). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 867, 30--39 (2021; Zbl 1477.68203) Full Text: DOI arXiv OpenURL
Dvořák, Pavel; Feldmann, Andreas E.; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1462.68138 SIAM J. Discrete Math. 35, No. 1, 546-574 (2021). MSC: 68R10 05C05 05C85 68Q17 68Q27 68W25 PDF BibTeX XML Cite \textit{P. Dvořák} et al., SIAM J. Discrete Math. 35, No. 1, 546--574 (2021; Zbl 1462.68138) Full Text: DOI OpenURL
Matsubayashi, Akira Non-greedy online Steiner trees on outerplanar graphs. (English) Zbl 07328486 Algorithmica 83, No. 2, 613-640 (2021). MSC: 68W27 68R10 PDF BibTeX XML Cite \textit{A. Matsubayashi}, Algorithmica 83, No. 2, 613--640 (2021; Zbl 07328486) Full Text: DOI OpenURL
Gaul, Daniela; Schmidt, Daniel R. Chvátal-Gomory cuts for the Steiner tree problem. (English) Zbl 1464.05039 Discrete Appl. Math. 291, 188-200 (2021). Reviewer: Xueliang Li (Tianjin) MSC: 05C05 05C82 90B10 90C05 PDF BibTeX XML Cite \textit{D. Gaul} and \textit{D. R. Schmidt}, Discrete Appl. Math. 291, 188--200 (2021; Zbl 1464.05039) Full Text: DOI OpenURL
Weißauer, Daniel Isometric subgraphs for Steiner distance. (English) Zbl 07500676 J. Graph Theory 94, No. 4, 597-613 (2020). MSC: 05C12 05C05 PDF BibTeX XML Cite \textit{D. Weißauer}, J. Graph Theory 94, No. 4, 597--613 (2020; Zbl 07500676) Full Text: DOI OpenURL
Ding, Wei; Qiu, Ke Minimum diameter vertex-weighted Steiner tree. (English) Zbl 1482.68173 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 62-72 (2020). MSC: 68R10 05C05 05C22 68W25 PDF BibTeX XML Cite \textit{W. Ding} and \textit{K. Qiu}, Lect. Notes Comput. Sci. 12290, 62--72 (2020; Zbl 1482.68173) Full Text: DOI OpenURL
Lichen, Junran; Li, Jianping; Wang, Wencheng; Yeh, Jean; Yeh, YeongNan; Yu, Xingxing; Zheng, Yujie On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\). (English) Zbl 1482.68255 Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 49-61 (2020). MSC: 68U05 05C05 68R10 68W25 68W40 PDF BibTeX XML Cite \textit{J. Lichen} et al., Lect. Notes Comput. Sci. 12290, 49--61 (2020; Zbl 1482.68255) Full Text: DOI OpenURL
Kisfaludi-Bak, Sándor; Nederlof, Jesper; van Leeuwen, Erik Jan Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces. (English) Zbl 07342471 ACM Trans. Algorithms 16, No. 3, Article No. 28, 30 p. (2020). MSC: 68R10 68W05 68W40 PDF BibTeX XML Cite \textit{S. Kisfaludi-Bak} et al., ACM Trans. Algorithms 16, No. 3, Article No. 28, 30 p. (2020; Zbl 07342471) Full Text: DOI OpenURL
Chan, T.-H. Hubert; Jiang, Haotian; Jiang, Shaofeng H.-C. A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics. (English) Zbl 07342467 ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020). MSC: 68W25 68R10 68W20 90C27 PDF BibTeX XML Cite \textit{T. H. H. Chan} et al., ACM Trans. Algorithms 16, No. 2, Article No. 24, 23 p. (2020; Zbl 07342467) Full Text: DOI Link OpenURL
Fomin, Fedor V.; Lokshtanov, Daniel; Kolay, Sudeshna; Panolan, Fahad; Saurabh, Saket Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (English) Zbl 07342464 ACM Trans. Algorithms 16, No. 2, Article No. 21, 37 p. (2020). MSC: 68R10 05C85 68Q25 68U05 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., ACM Trans. Algorithms 16, No. 2, Article No. 21, 37 p. (2020; Zbl 07342464) Full Text: DOI Link OpenURL
Bose, Prosenjit; D’Angelo, Anthony; Durocher, Stephane On the restricted 1-Steiner tree problem. (English) Zbl 07336125 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 448-459 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{P. Bose} et al., Lect. Notes Comput. Sci. 12273, 448--459 (2020; Zbl 07336125) Full Text: DOI OpenURL
Saikia, Parikshit; Karmakar, Sushanta Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE. (English) Zbl 1458.68278 Int. J. Found. Comput. Sci. 31, No. 7, 941-968 (2020). MSC: 68W15 68R10 68W25 90C27 PDF BibTeX XML Cite \textit{P. Saikia} and \textit{S. Karmakar}, Int. J. Found. Comput. Sci. 31, No. 7, 941--968 (2020; Zbl 1458.68278) Full Text: DOI arXiv OpenURL
Althaus, Ernst; Rauterberg, Felix; Ziegler, Sarah Computing Euclidean Steiner trees over segments. (English) Zbl 1457.90164 EURO J. Comput. Optim. 8, No. 3-4, 309-325 (2020). MSC: 90C35 PDF BibTeX XML Cite \textit{E. Althaus} et al., EURO J. Comput. Optim. 8, No. 3--4, 309--325 (2020; Zbl 1457.90164) Full Text: DOI OpenURL
Byrka, Jarosław; Grandoni, Fabrizio; Ameli, Afrouz Jabal Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. (English) Zbl 07298290 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 815-825 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Byrka} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 815--825 (2020; Zbl 07298290) Full Text: DOI arXiv OpenURL
Duan, Ran; Pettie, Seth Connectivity oracles for graphs subject to vertex failures. (English) Zbl 1467.68139 SIAM J. Comput. 49, No. 6, 1363-1396 (2020). Reviewer: Peter Sanders (Karlsruhe) MSC: 68R10 05C40 05C85 68P05 68U05 PDF BibTeX XML Cite \textit{R. Duan} and \textit{S. Pettie}, SIAM J. Comput. 49, No. 6, 1363--1396 (2020; Zbl 1467.68139) Full Text: DOI OpenURL
Bichler, Martin; Hao, Zhen; Littmann, Richard; Waldherr, Stefan Strategyproof auction mechanisms for network procurement. (English) Zbl 1456.90096 OR Spectrum 42, No. 4, 965-994 (2020). MSC: 90B80 90B10 PDF BibTeX XML Cite \textit{M. Bichler} et al., OR Spectrum 42, No. 4, 965--994 (2020; Zbl 1456.90096) Full Text: DOI OpenURL
Fruchard, Augustin; Zamfirescu, Tudor Cages of small length holding convex bodies. (English) Zbl 1454.52008 Discrete Comput. Geom. 64, No. 3, 814-837 (2020). Reviewer: Antal Joós (Baracs) MSC: 52B10 52A15 52A40 52A10 PDF BibTeX XML Cite \textit{A. Fruchard} and \textit{T. Zamfirescu}, Discrete Comput. Geom. 64, No. 3, 814--837 (2020; Zbl 1454.52008) Full Text: DOI HAL OpenURL
Stepanova, E. I. Bifurcations of Steiner tree topologies in the plane. (English. Russian original) Zbl 1451.37072 J. Math. Sci., New York 248, No. 6, 788-802 (2020); translation from Fundam. Prikl. Mat. 21, No. 6, 183-204 (2016). MSC: 37G10 37E25 37E15 PDF BibTeX XML Cite \textit{E. I. Stepanova}, J. Math. Sci., New York 248, No. 6, 788--802 (2020; Zbl 1451.37072); translation from Fundam. Prikl. Mat. 21, No. 6, 183--204 (2016) Full Text: DOI OpenURL
Cheng, Jingliang; Zheng, Xinyu; Chen, Shuangmin; Liu, Guozhu; Xin, Shiqing; Lu, Lin; Zhou, Yuanfeng; Tu, Changhe Skeletonization via dual of shape segmentation. (English) Zbl 07207273 Comput. Aided Geom. Des. 80, Article ID 101856, 12 p. (2020). MSC: 65Dxx PDF BibTeX XML Cite \textit{J. Cheng} et al., Comput. Aided Geom. Des. 80, Article ID 101856, 12 p. (2020; Zbl 07207273) Full Text: DOI OpenURL
Goyal, Keshav; Mömke, Tobias Robust reoptimization of Steiner trees. (English) Zbl 1442.68173 Algorithmica 82, No. 7, 1966-1988 (2020). MSC: 68R10 68W25 PDF BibTeX XML Cite \textit{K. Goyal} and \textit{T. Mömke}, Algorithmica 82, No. 7, 1966--1988 (2020; Zbl 1442.68173) Full Text: DOI OpenURL
D’Ambrosio, Claudia; Fampa, Marcia; Lee, Jon; Vigerske, Stefan On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs. (English) Zbl 1442.90135 Optim. Lett. 14, No. 2, 409-415 (2020). MSC: 90C11 90C35 PDF BibTeX XML Cite \textit{C. D'Ambrosio} et al., Optim. Lett. 14, No. 2, 409--415 (2020; Zbl 1442.90135) Full Text: DOI OpenURL
Guo, Wenzhong; Huang, Xing PORA: a Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit design. (English) Zbl 1481.94161 Appl. Math. Modelling 78, 268-286 (2020). MSC: 94C05 05C90 PDF BibTeX XML Cite \textit{W. Guo} and \textit{X. Huang}, Appl. Math. Modelling 78, 268--286 (2020; Zbl 1481.94161) Full Text: DOI OpenURL
Melo, Alexsander A.; Figueiredo, Celina M. H.; Souza, Uéverton S. A multivariate analysis of the strict terminal connection problem. (English) Zbl 1435.90040 J. Comput. Syst. Sci. 111, 22-41 (2020). MSC: 90B10 90B18 05C82 PDF BibTeX XML Cite \textit{A. A. Melo} et al., J. Comput. Syst. Sci. 111, 22--41 (2020; Zbl 1435.90040) Full Text: DOI OpenURL
Grodet, Aymeric; Tsuchiya, Takuya Reorganizing topologies of Steiner trees to accelerate their eliminations. (English) Zbl 1440.90082 Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050003, 21 p. (2020). MSC: 90C35 05C05 90C57 PDF BibTeX XML Cite \textit{A. Grodet} and \textit{T. Tsuchiya}, Discrete Math. Algorithms Appl. 12, No. 1, Article ID 2050003, 21 p. (2020; Zbl 1440.90082) Full Text: DOI arXiv OpenURL
Li, Jianping; Liu, Suding; Lichen, Junran; Wang, Wencheng; Zheng, Yujie Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. (English) Zbl 1437.90139 J. Comb. Optim. 39, No. 2, 492-508 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{J. Li} et al., J. Comb. Optim. 39, No. 2, 492--508 (2020; Zbl 1437.90139) Full Text: DOI OpenURL
Huang, Lingxiao; Li, Jian; Shi, Qicai Approximation algorithms for the connected sensor cover problem. (English) Zbl 1436.68383 Theor. Comput. Sci. 809, 563-574 (2020). MSC: 68U05 68M18 68W25 PDF BibTeX XML Cite \textit{L. Huang} et al., Theor. Comput. Sci. 809, 563--574 (2020; Zbl 1436.68383) Full Text: DOI arXiv OpenURL
Zhao, Yan More on the minimum size of graphs with given rainbow index. (English) Zbl 1430.05045 Discuss. Math., Graph Theory 40, No. 1, 227-241 (2020). MSC: 05C15 05C40 05C12 05C35 05C75 PDF BibTeX XML Cite \textit{Y. Zhao}, Discuss. Math., Graph Theory 40, No. 1, 227--241 (2020; Zbl 1430.05045) Full Text: DOI OpenURL
Bonnet, Édouard; Sikora, Florian The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. (English) Zbl 07378612 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 26, 15 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{É. Bonnet} and \textit{F. Sikora}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 26, 15 p. (2019; Zbl 07378612) Full Text: DOI OpenURL
Ahmed, Reyan; Angelini, Patrizio; Sahneh, Faryad Darabi; Efrat, Alon; Glickenstein, David; Gronemann, Martin; Heinsohn, Niklas; Kobourov, Stephen G.; Spence, Richard; Watkins, Joseph; Wolff, Alexander Multi-level Steiner trees. (English) Zbl 07335954 ACM J. Exp. Algorithm. 24, No. 2, Article No. 2.5, 22 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{R. Ahmed} et al., ACM J. Exp. Algorithm. 24, No. 2, Article No. 2.5, 22 p. (2019; Zbl 07335954) Full Text: DOI OpenURL
Yaw, Sean; Middleton, Richard S.; Hoover, Brendan Graph simplification for infrastructure network design. (English) Zbl 1435.68246 Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 576-589 (2019). MSC: 68R10 68M10 PDF BibTeX XML Cite \textit{S. Yaw} et al., Lect. Notes Comput. Sci. 11949, 576--589 (2019; Zbl 1435.68246) Full Text: DOI Link OpenURL
Disser, Yann; Feldmann, Andreas Emil; Klimm, Max; Könemann, Jochen Travelling on graphs with small highway dimension. (English) Zbl 07173299 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 175-189 (2019). MSC: 68R10 PDF BibTeX XML Cite \textit{Y. Disser} et al., Lect. Notes Comput. Sci. 11789, 175--189 (2019; Zbl 07173299) Full Text: DOI arXiv OpenURL
Ducoffe, Guillaume The 4-Steiner Root problem. (English) Zbl 07173287 Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 14-26 (2019). MSC: 68R10 PDF BibTeX XML Cite \textit{G. Ducoffe}, Lect. Notes Comput. Sci. 11789, 14--26 (2019; Zbl 07173287) Full Text: DOI HAL OpenURL
Hill, Alessandro; Voß, Stefan; Baldacci, Roberto Branch-and-cut algorithms for Steiner tree problems with privacy conflicts. (English) Zbl 07172845 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11653, 266-278 (2019). MSC: 68Rxx PDF BibTeX XML Cite \textit{A. Hill} et al., Lect. Notes Comput. Sci. 11653, 266--278 (2019; Zbl 07172845) Full Text: DOI OpenURL
Grandoni, Fabrizio; Laekhanukit, Bundit; Li, Shi \(O(\log^2 k/\log\log k)\)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. (English) Zbl 1433.68614 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 253-264 (2019). MSC: 68W25 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{F. Grandoni} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 253--264 (2019; Zbl 1433.68614) Full Text: DOI arXiv OpenURL
Hill, Alessandro; Baldacci, Roberto; Hoshino, Edna Ayako Capacitated ring arborescence problems with profits. (English) Zbl 1428.90032 OR Spectrum 41, No. 2, 357-389 (2019). MSC: 90B10 90C35 90C27 90B06 90C11 90C59 90C57 PDF BibTeX XML Cite \textit{A. Hill} et al., OR Spectrum 41, No. 2, 357--389 (2019; Zbl 1428.90032) Full Text: DOI OpenURL
Zhang, Jie; Zhang, Guang-Jun; Wang, Hua; Zhang, Xiao-Dong Extremal trees with respect to the Steiner Wiener index. (English) Zbl 1427.05083 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950067, 16 p. (2019). MSC: 05C12 05C35 PDF BibTeX XML Cite \textit{J. Zhang} et al., Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950067, 16 p. (2019; Zbl 1427.05083) Full Text: DOI OpenURL
Zhang, Jie; Wang, Hua; Zhang, Xiao-Dong The Steiner Wiener index of trees with a given segment sequence. (English) Zbl 1428.05074 Appl. Math. Comput. 344-345, 20-29 (2019). MSC: 05C09 05C07 05C12 PDF BibTeX XML Cite \textit{J. Zhang} et al., Appl. Math. Comput. 344--345, 20--29 (2019; Zbl 1428.05074) Full Text: DOI arXiv OpenURL
Clark, Chad; Egri-Nagy, Attila; Francis, Andrew; Gebhardt, Volker Bacterial phylogeny in the Cayley graph. (English) Zbl 1426.05063 Discrete Math. Algorithms Appl. 11, No. 5, Article ID 1950059, 14 p. (2019). MSC: 05C25 05C12 05C90 06A07 92D15 92D10 PDF BibTeX XML Cite \textit{C. Clark} et al., Discrete Math. Algorithms Appl. 11, No. 5, Article ID 1950059, 14 p. (2019; Zbl 1426.05063) Full Text: DOI arXiv OpenURL
Ivanova, Marika; Haugland, Dag Integer programming formulations for the shared multicast tree problem. (English) Zbl 1431.90095 J. Comb. Optim. 38, No. 3, 927-956 (2019). MSC: 90C10 90B18 90C35 PDF BibTeX XML Cite \textit{M. Ivanova} and \textit{D. Haugland}, J. Comb. Optim. 38, No. 3, 927--956 (2019; Zbl 1431.90095) Full Text: DOI Link OpenURL
Shinano, Yuji; Rehfeldt, Daniel; Koch, Thorsten Building optimal Steiner trees on supercomputers by using up to 43,000 cores. (English) Zbl 07116716 Rousseau, Louis-Martin (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11494, 529-539 (2019). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{Y. Shinano} et al., Lect. Notes Comput. Sci. 11494, 529--539 (2019; Zbl 07116716) Full Text: DOI OpenURL
Dondl, Patrick W.; Novaga, Matteo; Wirth, Benedikt; Wojtowytsch, Stephan A phase-field approximation of the perimeter under a connectedness constraint. (English) Zbl 1433.49017 SIAM J. Math. Anal. 51, No. 5, 3902-3920 (2019). Reviewer: Giuliano Lazzaroni (Firenze) MSC: 49J45 51E10 PDF BibTeX XML Cite \textit{P. W. Dondl} et al., SIAM J. Math. Anal. 51, No. 5, 3902--3920 (2019; Zbl 1433.49017) Full Text: DOI OpenURL
Fukunaga, Takuro; Maehara, Takanori Computing a tree having a small vertex cover. (English) Zbl 1430.68203 Theor. Comput. Sci. 791, 48-61 (2019). MSC: 68R10 05C62 05C70 68W25 PDF BibTeX XML Cite \textit{T. Fukunaga} and \textit{T. Maehara}, Theor. Comput. Sci. 791, 48--61 (2019; Zbl 1430.68203) Full Text: DOI arXiv OpenURL
Angelopoulos, Spyros Parameterized analysis of the online priority and node-weighted Steiner tree problems. (English) Zbl 1430.68453 Theory Comput. Syst. 63, No. 6, 1413-1447 (2019). MSC: 68W27 68Q25 68R10 PDF BibTeX XML Cite \textit{S. Angelopoulos}, Theory Comput. Syst. 63, No. 6, 1413--1447 (2019; Zbl 1430.68453) Full Text: DOI HAL OpenURL
Ivanov, A. O.; Nikolaeva, N. K.; Tuzhilin, A. A. Steiner problem in the Gromov-Hausdorff space: the case of finite metric spaces. (English. Russian original) Zbl 1432.54028 Proc. Steklov Inst. Math. 304, Suppl. 1, S88-S96 (2019); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 23, No. 4, 152-161 (2017). Reviewer: Aleksey A. Dovgoshey (Slovyansk) MSC: 54E35 54B20 05C05 05C22 PDF BibTeX XML Cite \textit{A. O. Ivanov} et al., Proc. Steklov Inst. Math. 304, S88--S96 (2019; Zbl 1432.54028); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 23, No. 4, 152--161 (2017) Full Text: DOI arXiv OpenURL
Angel, Eric; Nguyen Kim, Thang; Singh, Shikha Approximating \(k\)-forest with resource augmentation: a primal-dual approach. (English) Zbl 1423.68586 Theor. Comput. Sci. 788, 12-20 (2019). MSC: 68W25 90C10 90C35 PDF BibTeX XML Cite \textit{E. Angel} et al., Theor. Comput. Sci. 788, 12--20 (2019; Zbl 1423.68586) Full Text: DOI arXiv OpenURL
Warnow, Tandy (ed.) Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret. (English) Zbl 1429.92003 Computational Biology 29. Cham: Springer (ISBN 978-3-030-10836-6/hbk; 978-3-030-10837-3/ebook). xxv, 410 p. (2019). Reviewer: Irina Ioana Mohorianu (Oxford) MSC: 92-06 00B15 92D15 92C42 90C10 PDF BibTeX XML Cite \textit{T. Warnow} (ed.), Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret. Cham: Springer (2019; Zbl 1429.92003) Full Text: DOI Link OpenURL
Ivanov, A.; Tuzhilin, A. Steiner type ratios of Gromov-Hausdorff space. (English) Zbl 1415.05088 Eur. J. Comb. 80, 172-183 (2019). MSC: 05C35 05C05 05C12 PDF BibTeX XML Cite \textit{A. Ivanov} and \textit{A. Tuzhilin}, Eur. J. Comb. 80, 172--183 (2019; Zbl 1415.05088) Full Text: DOI OpenURL
Han, Lu; Xu, Dachuan; Du, Donglei; Wu, Chenchen A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem. (English) Zbl 1422.90062 Optim. Lett. 13, No. 3, 573-585 (2019). MSC: 90C35 PDF BibTeX XML Cite \textit{L. Han} et al., Optim. Lett. 13, No. 3, 573--585 (2019; Zbl 1422.90062) Full Text: DOI OpenURL
Ahadi, Arash; Zarei, Alireza Connecting guards with minimum Steiner points inside simple polygons. (English) Zbl 1427.68325 Theor. Comput. Sci. 775, 26-31 (2019). Reviewer: Krzystof Gdawiec (Sosnowiec) MSC: 68U05 68Q17 68Q25 68R10 68W25 PDF BibTeX XML Cite \textit{A. Ahadi} and \textit{A. Zarei}, Theor. Comput. Sci. 775, 26--31 (2019; Zbl 1427.68325) Full Text: DOI OpenURL
Matsuda, Yusa; Takahashi, Satoshi A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems. (English) Zbl 1420.90078 Optim. Lett. 13, No. 2, 341-348 (2019). MSC: 90C35 90C59 90C27 PDF BibTeX XML Cite \textit{Y. Matsuda} and \textit{S. Takahashi}, Optim. Lett. 13, No. 2, 341--348 (2019; Zbl 1420.90078) Full Text: DOI arXiv OpenURL
Beyer, Stephan; Chimani, Markus Strong Steiner tree approximations in practice. (English) Zbl 07043416 ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.7, 33 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{S. Beyer} and \textit{M. Chimani}, ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.7, 33 p. (2019; Zbl 07043416) Full Text: DOI arXiv OpenURL
Massaccesi, Annalisa; Oudet, Edouard; Velichkov, Bozhidar Numerical calibration of Steiner trees. (English) Zbl 1448.49003 Appl. Math. Optim. 79, No. 1, 69-86 (2019). Reviewer: Bülent Karasözen (Ankara) MSC: 49J05 35R35 49M05 35J25 51E10 05C05 05C35 49Q10 PDF BibTeX XML Cite \textit{A. Massaccesi} et al., Appl. Math. Optim. 79, No. 1, 69--86 (2019; Zbl 1448.49003) Full Text: DOI Link OpenURL
Rehfeldt, Daniel; Koch, Thorsten; Maher, Stephen J. Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. (English) Zbl 1409.90048 Networks 73, No. 2, 206-233 (2019). MSC: 90B18 PDF BibTeX XML Cite \textit{D. Rehfeldt} et al., Networks 73, No. 2, 206--233 (2019; Zbl 1409.90048) Full Text: DOI Link OpenURL
Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1404.05208 SIAM J. Discrete Math. 33, No. 1, 327-345 (2019). MSC: 05C85 05C22 05C40 68Q25 68W05 68W40 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Discrete Math. 33, No. 1, 327--345 (2019; Zbl 1404.05208) Full Text: DOI OpenURL
Hua, Hao; Hovestadt, Ludger; Tang, Peng; Li, Biao Integer programming for urban design. (English) Zbl 1430.90580 Eur. J. Oper. Res. 274, No. 3, 1125-1137 (2019). MSC: 90C90 90C10 PDF BibTeX XML Cite \textit{H. Hua} et al., Eur. J. Oper. Res. 274, No. 3, 1125--1137 (2019; Zbl 1430.90580) Full Text: DOI OpenURL
Chan, T-H. Hubert; Jiang, Haotian; Jiang, Shaofeng H.-C. A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics. (English) Zbl 07378685 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 15, 13 p. (2018). MSC: 68W25 68R10 68W20 90C27 PDF BibTeX XML Cite \textit{T-H. H. Chan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 15, 13 p. (2018; Zbl 07378685) Full Text: DOI arXiv OpenURL
Chalermsook, Parinya; Das, Syamantak; Even, Guy; Laekhanukit, Bundit; Vaz, Daniel Survivable network design for group connectivity in low-treewidth graphs. (English) Zbl 07378620 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 8, 19 p. (2018). MSC: 68W20 68W25 90C27 PDF BibTeX XML Cite \textit{P. Chalermsook} et al., LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 8, 19 p. (2018; Zbl 07378620) Full Text: DOI arXiv OpenURL
Bilò, Davide New algorithms for Steiner tree reoptimization. (English) Zbl 07375946 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{D. Bilò}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 19, 14 p. (2018; Zbl 07375946) Full Text: DOI arXiv OpenURL
Ahmed, Reyan; Angelini, Patrizio; Sahneh, Faryad Darabi; Efrat, Alon; Glickenstein, David; Gronemann, Martin; Heinsohn, Niklas; Kobourov, Stephen G.; Spence, Richard; Watkins, Joseph; Wolff, Alexander Multi-level Steiner trees. (English) Zbl 07286688 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 15, 14 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{R. Ahmed} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 15, 14 p. (2018; Zbl 07286688) Full Text: DOI arXiv OpenURL
Dvořák, Pavel; Feldmann, Andreas Emil; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 07228417 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 26, 15 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Dvořák} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 26, 15 p. (2018; Zbl 07228417) Full Text: DOI arXiv OpenURL
Chen, Yen Hung; Lin, Ying Chih Approximation algorithms for the Terminal Steiner Tree problem. (English) Zbl 07122368 Appl. Comput. Math. 17, No. 3, 246-255 (2018). MSC: 68M10 68R10 68W25 68W40 PDF BibTeX XML Cite \textit{Y. H. Chen} and \textit{Y. C. Lin}, Appl. Comput. Math. 17, No. 3, 246--255 (2018; Zbl 07122368) Full Text: Link OpenURL
Swanepoel, Konrad J. Combinatorial distance geometry in normed spaces. (English) Zbl 1419.52018 Ambrus, Gergely (ed.) et al., New trends in intuitive geometry. Berlin: Springer/Bolyai Society. Bolyai Soc. Math. Stud. 27, 407-458 (2018). Reviewer: László A. Székely (Columbia) MSC: 52C10 46B20 PDF BibTeX XML Cite \textit{K. J. Swanepoel}, Bolyai Soc. Math. Stud. 27, 407--458 (2018; Zbl 1419.52018) Full Text: DOI arXiv OpenURL
Juhl, Daniel; Warme, David M.; Winter, Pawel; Zachariasen, Martin The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. (English) Zbl 1411.90225 Math. Program. Comput. 10, No. 4, 487-532 (2018). MSC: 90C10 90C27 05C05 05C65 51N20 68W35 PDF BibTeX XML Cite \textit{D. Juhl} et al., Math. Program. Comput. 10, No. 4, 487--532 (2018; Zbl 1411.90225) Full Text: DOI Link OpenURL
Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan Network sparsification for Steiner problems on planar and bounded-genus graphs. (English) Zbl 1454.68114 ACM Trans. Algorithms 14, No. 4, Article No. 53, 73 p. (2018). MSC: 68R10 05C10 05C85 68Q27 68W40 PDF BibTeX XML Cite \textit{M. Pilipczuk} et al., ACM Trans. Algorithms 14, No. 4, Article No. 53, 73 p. (2018; Zbl 1454.68114) Full Text: DOI arXiv OpenURL
Bonafini, Mauro; Orlandi, Giandomenico; Oudet, Édouard Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets. (English) Zbl 1409.49011 Atti Accad. Naz. Lincei, Cl. Sci. Fis. Mat. Nat., IX. Ser., Rend. Lincei, Mat. Appl. 29, No. 4, 597-606 (2018). MSC: 49J45 49Q15 49Q20 49M20 65K10 PDF BibTeX XML Cite \textit{M. Bonafini} et al., Atti Accad. Naz. Lincei, Cl. Sci. Fis. Mat. Nat., IX. Ser., Rend. Lincei, Mat. Appl. 29, No. 4, 597--606 (2018; Zbl 1409.49011) Full Text: DOI OpenURL
Li, Yinkui; Mao, Yaping A result on the 3-generalized connectivity of a graph and its line graph. (English) Zbl 1408.05039 Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 2019-2027 (2018). MSC: 05C05 05C40 05C70 05C75 05C76 PDF BibTeX XML Cite \textit{Y. Li} and \textit{Y. Mao}, Bull. Malays. Math. Sci. Soc. (2) 41, No. 4, 2019--2027 (2018; Zbl 1408.05039) Full Text: DOI OpenURL
Qian, Jiawei; Umboh, Seeun William; Williamson, David P. Online constrained forest and prize-collecting network design. (English) Zbl 1412.68302 Algorithmica 80, No. 11, 3335-3364 (2018). MSC: 68W27 68R10 PDF BibTeX XML Cite \textit{J. Qian} et al., Algorithmica 80, No. 11, 3335--3364 (2018; Zbl 1412.68302) Full Text: DOI arXiv OpenURL
Cherkashin, Danila; Teplitskaya, Yana On the horseshoe conjecture for maximal distance minimizers. (English) Zbl 1405.49031 ESAIM, Control Optim. Calc. Var. 24, No. 3, 1015-1041 (2018). MSC: 49Q10 49Q20 49K30 90B10 90C27 PDF BibTeX XML Cite \textit{D. Cherkashin} and \textit{Y. Teplitskaya}, ESAIM, Control Optim. Calc. Var. 24, No. 3, 1015--1041 (2018; Zbl 1405.49031) Full Text: DOI arXiv OpenURL
Fefferman, Charles; Shvartsman, Pavel Sharp finiteness principles for Lipschitz selections. (English) Zbl 1412.46044 Geom. Funct. Anal. 28, No. 6, 1641-1705 (2018). Reviewer: Oscar Blasco (Valencia) MSC: 46E35 PDF BibTeX XML Cite \textit{C. Fefferman} and \textit{P. Shvartsman}, Geom. Funct. Anal. 28, No. 6, 1641--1705 (2018; Zbl 1412.46044) Full Text: DOI arXiv OpenURL
Mao, Yaping; Cheng, Eddie; Wang, Zhao Steiner distance in product networks. (English) Zbl 1401.05098 Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 8, 25 p. (2018). MSC: 05C12 05C82 05C05 05C76 05C40 PDF BibTeX XML Cite \textit{Y. Mao} et al., Discrete Math. Theor. Comput. Sci. 20, No. 2, Paper No. 8, 25 p. (2018; Zbl 1401.05098) Full Text: arXiv Link OpenURL
Rehfeldt, Daniel; Koch, Thorsten Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap. (English) Zbl 1413.90228 J. Comput. Math. 36, No. 3, 459-468 (2018). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{D. Rehfeldt} and \textit{T. Koch}, J. Comput. Math. 36, No. 3, 459--468 (2018; Zbl 1413.90228) Full Text: DOI Link OpenURL
Cohen, Nachshon; Nutov, Zeev Approximating Steiner trees and forests with minimum number of Steiner points. (English) Zbl 1397.05171 J. Comput. Syst. Sci. 98, 53-64 (2018). MSC: 05C82 05C85 05C05 68W25 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{Z. Nutov}, J. Comput. Syst. Sci. 98, 53--64 (2018; Zbl 1397.05171) Full Text: DOI Link OpenURL
Buchanan, Austin; Wang, Yiming; Butenko, Sergiy Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. (English) Zbl 1396.90016 Networks 72, No. 2, 238-248 (2018). MSC: 90B18 90C39 90C35 PDF BibTeX XML Cite \textit{A. Buchanan} et al., Networks 72, No. 2, 238--248 (2018; Zbl 1396.90016) Full Text: DOI OpenURL
Borndörfer, Ralf; Karbstein, Marika An approximation algorithm for the Steiner connectivity problem. (English) Zbl 1396.90015 Networks 72, No. 2, 174-181 (2018). MSC: 90B18 90C59 90B06 PDF BibTeX XML Cite \textit{R. Borndörfer} and \textit{M. Karbstein}, Networks 72, No. 2, 174--181 (2018; Zbl 1396.90015) Full Text: DOI OpenURL
Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian A \((1+\varepsilon)\)-embedding of low highway dimension graphs into bounded treewidth graphs. (English) Zbl 1398.68672 SIAM J. Comput. 47, No. 4, 1667-1704 (2018). MSC: 68W25 68Q25 90B06 90C35 PDF BibTeX XML Cite \textit{A. E. Feldmann} et al., SIAM J. Comput. 47, No. 4, 1667--1704 (2018; Zbl 1398.68672) Full Text: DOI OpenURL
Markarian, Christine An optimal algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. (English) Zbl 06932705 Iliopoulos, Costas (ed.) et al., Combinatorial algorithms. 29th international workshop, IWOCA 2018, Singapore, July 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10979, 214-223 (2018). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Markarian}, Lect. Notes Comput. Sci. 10979, 214--223 (2018; Zbl 06932705) Full Text: DOI OpenURL
Zachos, Anastasios N.; Zouzoulas, Gerasimos An evolutionary structure of convex quadrilaterals. III. (English) Zbl 1396.52004 J. Convex Anal. 25, No. 3, 759-765 (2018). MSC: 52A10 51E12 52A55 51E10 PDF BibTeX XML Cite \textit{A. N. Zachos} and \textit{G. Zouzoulas}, J. Convex Anal. 25, No. 3, 759--765 (2018; Zbl 1396.52004) Full Text: Link OpenURL
Bar-Yehuda, Reuven; Kantor, Erez; Kutten, Shay; Rawitz, Dror Growing half-balls: minimizing storage and communication costs in content delivery networks. (English) Zbl 1398.68658 SIAM J. Discrete Math. 32, No. 3, 1903-1921 (2018). MSC: 68W25 68M11 68P20 68Q17 68W27 PDF BibTeX XML Cite \textit{R. Bar-Yehuda} et al., SIAM J. Discrete Math. 32, No. 3, 1903--1921 (2018; Zbl 1398.68658) Full Text: DOI OpenURL
Cambazard, Hadrien; Catusse, Nicolas Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. (English) Zbl 1403.90567 Eur. J. Oper. Res. 270, No. 2, 419-429 (2018). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{H. Cambazard} and \textit{N. Catusse}, Eur. J. Oper. Res. 270, No. 2, 419--429 (2018; Zbl 1403.90567) Full Text: DOI arXiv OpenURL
Hill, Alessandro; Schwarze, Silvia Exact algorithms for bi-objective ring tree problems with reliability measures. (English) Zbl 1391.90605 Comput. Oper. Res. 94, 38-51 (2018). MSC: 90C35 90B18 90C29 90B25 PDF BibTeX XML Cite \textit{A. Hill} and \textit{S. Schwarze}, Comput. Oper. Res. 94, 38--51 (2018; Zbl 1391.90605) Full Text: DOI OpenURL
Bateni, Mohammad Hossein; Hajiaghayi, Mohammad Taghi; Liaghat, Vahid Improved approximation algorithms for (budgeted) node-weighted Steiner problems. (English) Zbl 1396.68134 SIAM J. Comput. 47, No. 4, 1275-1293 (2018). MSC: 68W25 05C85 68R10 PDF BibTeX XML Cite \textit{M. H. Bateni} et al., SIAM J. Comput. 47, No. 4, 1275--1293 (2018; Zbl 1396.68134) Full Text: DOI OpenURL