Frieze, Alan M.; Tkocz, Tomasz A randomly weighted minimum arborescence with a random cost constraint. (English) Zbl 07548082 Math. Oper. Res. 47, No. 2, 1664-1680 (2022). MSC: 05C80 90C27 PDF BibTeX XML Cite \textit{A. M. Frieze} and \textit{T. Tkocz}, Math. Oper. Res. 47, No. 2, 1664--1680 (2022; Zbl 07548082) Full Text: DOI OpenURL
Ghuge, Rohan; Nagarajan, Viswanath Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems. (English) Zbl 07548079 Math. Oper. Res. 47, No. 2, 1612-1630 (2022). MSC: 68W25 68R10 90C27 PDF BibTeX XML Cite \textit{R. Ghuge} and \textit{V. Nagarajan}, Math. Oper. Res. 47, No. 2, 1612--1630 (2022; Zbl 07548079) Full Text: DOI OpenURL
Takazawa, Kenjiro Excluded \(t\)-factors in bipartite graphs: unified framework for nonbipartite matchings, restricted 2-matchings, and matroids. (English) Zbl 07501964 SIAM J. Discrete Math. 36, No. 1, 702-727 (2022). MSC: 05C70 05B35 05C85 68R10 90C27 90C35 PDF BibTeX XML Cite \textit{K. Takazawa}, SIAM J. Discrete Math. 36, No. 1, 702--727 (2022; Zbl 07501964) Full Text: DOI OpenURL
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike Popular branchings and their dual certificates. (English) Zbl 07495432 Math. Program. 192, No. 1-2 (B), 567-595 (2022). MSC: 90C27 90C46 68W01 PDF BibTeX XML Cite \textit{T. Kavitha} et al., Math. Program. 192, No. 1--2 (B), 567--595 (2022; Zbl 07495432) Full Text: DOI OpenURL
Bérczi, Kristóf; Boros, Endre; Čepek, Ondřej; Kučera, Petr; Makino, Kazuhisa Approximating minimum representations of key Horn functions. (English) Zbl 07488097 SIAM J. Comput. 51, No. 1, 116-138 (2022). MSC: 68W25 90C27 06E30 05C85 PDF BibTeX XML Cite \textit{K. Bérczi} et al., SIAM J. Comput. 51, No. 1, 116--138 (2022; Zbl 07488097) Full Text: DOI arXiv OpenURL
Lichen, Junran; Cai, Lijian; Li, Jianping; Liu, Suding; Pan, Pengxiang; Wang, Wencheng Delay-constrained minimum shortest path trees and related problems. (English) Zbl 07550561 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 676-686 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{J. Lichen} et al., Lect. Notes Comput. Sci. 13135, 676--686 (2021; Zbl 07550561) Full Text: DOI OpenURL
Plotnikov, Roman; Erzin, Adil; Zalyubovskiy, Vyacheslav GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN. (English) Zbl 07548202 Optim. Methods Softw. 36, No. 4, 697-719 (2021). MSC: 90Cxx 65Kxx PDF BibTeX XML Cite \textit{R. Plotnikov} et al., Optim. Methods Softw. 36, No. 4, 697--719 (2021; Zbl 07548202) Full Text: DOI OpenURL
Behrendt, Lukas; Casel, Katrin; Friedrich, Tobias; Lagodzinski, J. A. Gregor; Löser, Alexander; Wilhelm, Marcus From symmetry to asymmetry: generalizing TSP approximations by parametrization. (English) Zbl 07530224 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 53-66 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Behrendt} et al., Lect. Notes Comput. Sci. 12867, 53--66 (2021; Zbl 07530224) Full Text: DOI OpenURL
Lenzen, Christoph; Vahidi, Hossein Approximate minimum directed spanning trees under congestion. (English) Zbl 07495149 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 352-369 (2021). MSC: 68Mxx 68Q11 68R10 PDF BibTeX XML Cite \textit{C. Lenzen} and \textit{H. Vahidi}, Lect. Notes Comput. Sci. 12810, 352--369 (2021; Zbl 07495149) Full Text: DOI OpenURL
Dall’Asta, Luca Coordination problems on networks revisited: statics and dynamics. (English) Zbl 07430632 J. Stat. Mech. Theory Exp. 2021, No. 11, Article ID 113404, 83 p. (2021). MSC: 82-XX PDF BibTeX XML Cite \textit{L. Dall'Asta}, J. Stat. Mech. Theory Exp. 2021, No. 11, Article ID 113404, 83 p. (2021; Zbl 07430632) Full Text: DOI arXiv OpenURL
Lin, Lin; Cao, Jinde; Zhu, Shiyong; Shi, Peng Minimum-time and minimum-triggering impulsive stabilization for multi-agent systems over finite fields. (English) Zbl 1478.93029 Syst. Control Lett. 155, Article ID 104991, 12 p. (2021). MSC: 93A16 93C27 93D05 49N90 PDF BibTeX XML Cite \textit{L. Lin} et al., Syst. Control Lett. 155, Article ID 104991, 12 p. (2021; Zbl 1478.93029) Full Text: DOI OpenURL
Abu-Affash, A. Karim; Carmi, Paz; Katz, Matthew J. Minimizing total interference in asymmetric sensor networks. (English) Zbl 07407477 Theor. Comput. Sci. 889, 171-181 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{A. K. Abu-Affash} et al., Theor. Comput. Sci. 889, 171--181 (2021; Zbl 07407477) Full Text: DOI OpenURL
Boehmer, Niclas; Bredereck, Robert; Heeger, Klaus; Niedermeier, Rolf Bribery and control in stable marriage. (English) Zbl 07406487 J. Artif. Intell. Res. (JAIR) 71, 993-1048 (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{N. Boehmer} et al., J. Artif. Intell. Res. (JAIR) 71, 993--1048 (2021; Zbl 07406487) Full Text: DOI arXiv OpenURL
Abdi, Ahmad; Cornuéjols, Gérard; Lee, Dabeen Resistant sets in the unit hypercube. (English) Zbl 1469.90119 Math. Oper. Res. 46, No. 1, 82-114 (2021). MSC: 90C27 90C57 05B35 PDF BibTeX XML Cite \textit{A. Abdi} et al., Math. Oper. Res. 46, No. 1, 82--114 (2021; Zbl 1469.90119) Full Text: DOI Link OpenURL
Murota, Kazuo; Takazawa, Kenjiro Relationship of two formulations for shortest bibranchings. (English) Zbl 1467.05094 Japan J. Ind. Appl. Math. 38, No. 1, 141-161 (2021). MSC: 05C20 05C22 90C05 90C25 90C27 PDF BibTeX XML Cite \textit{K. Murota} and \textit{K. Takazawa}, Japan J. Ind. Appl. Math. 38, No. 1, 141--161 (2021; Zbl 1467.05094) Full Text: DOI arXiv OpenURL
Frank, András; Hajdu, Gergely A simple algorithm and min-max formula for the inverse arborescence problem. (English) Zbl 1462.90105 Discrete Appl. Math. 295, 85-93 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{A. Frank} and \textit{G. Hajdu}, Discrete Appl. Math. 295, 85--93 (2021; Zbl 1462.90105) Full Text: DOI OpenURL
Hershkowitz, D. Ellis; Kehne, Gregory; Ravi, R. An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. (English) Zbl 07319585 Inf. Process. Lett. 167, Article ID 106067, 5 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. E. Hershkowitz} et al., Inf. Process. Lett. 167, Article ID 106067, 5 p. (2021; Zbl 07319585) Full Text: DOI arXiv OpenURL
Fertin, Guillaume; Fradin, Julien; Jean, Géraldine The Maximum Colorful Arborescence problem: how (computationally) hard can it be? (English) Zbl 1477.68224 Theor. Comput. Sci. 852, 104-120 (2021). MSC: 68R10 68Q17 68Q27 68W05 68W25 PDF BibTeX XML Cite \textit{G. Fertin} et al., Theor. Comput. Sci. 852, 104--120 (2021; Zbl 1477.68224) Full Text: DOI OpenURL
Amoruso, Marco; Anello, Daniele; Auletta, Vincenzo; Cerulli, Raffaele; Ferraioli, Diodato; Raiconi, Andrea Contrasting the spread of misinformation in online social networks. (English) Zbl 07283367 J. Artif. Intell. Res. (JAIR) 69, 847-879 (2020). MSC: 68Txx PDF BibTeX XML Cite \textit{M. Amoruso} et al., J. Artif. Intell. Res. (JAIR) 69, 847--879 (2020; Zbl 07283367) Full Text: DOI OpenURL
Estes, Alexander S.; Ball, Michael O. Facets of the stochastic network flow problem. (English) Zbl 1450.90056 SIAM J. Optim. 30, No. 3, 2355-2378 (2020). MSC: 90C35 90C27 90C57 PDF BibTeX XML Cite \textit{A. S. Estes} and \textit{M. O. Ball}, SIAM J. Optim. 30, No. 3, 2355--2378 (2020; Zbl 1450.90056) Full Text: DOI OpenURL
Köhne, Anna; Traub, Vera; Vygen, Jens The asymmetric traveling salesman path LP has constant integrality ratio. (English) Zbl 1450.90043 Math. Program. 183, No. 1-2 (B), 379-395 (2020). MSC: 90C27 68W25 05C85 PDF BibTeX XML Cite \textit{A. Köhne} et al., Math. Program. 183, No. 1--2 (B), 379--395 (2020; Zbl 1450.90043) Full Text: DOI arXiv OpenURL
Lee, Ching-pei; Chang, Kai-Wei Distributed block-diagonal approximation methods for regularized empirical risk minimization. (English) Zbl 07224985 Mach. Learn. 109, No. 4, 813-852 (2020). MSC: 68T05 PDF BibTeX XML Cite \textit{C.-p. Lee} and \textit{K.-W. Chang}, Mach. Learn. 109, No. 4, 813--852 (2020; Zbl 07224985) Full Text: DOI arXiv OpenURL
Kakimura, Naonori; Kamiyama, Naoyuki; Takazawa, Kenjiro The \(b\)-branching problem in digraphs. (English) Zbl 1442.05076 Discrete Appl. Math. 283, 565-576 (2020). MSC: 05C20 05C85 05B35 52B40 PDF BibTeX XML Cite \textit{N. Kakimura} et al., Discrete Appl. Math. 283, 565--576 (2020; Zbl 1442.05076) Full Text: DOI OpenURL
Ritt, Marcus; Pereira, Jordi Heuristic and exact algorithms for minimum-weight non-spanning arborescences. (English) Zbl 1443.90325 Eur. J. Oper. Res. 287, No. 1, 61-75 (2020). MSC: 90C35 90C10 90C57 90C59 PDF BibTeX XML Cite \textit{M. Ritt} and \textit{J. Pereira}, Eur. J. Oper. Res. 287, No. 1, 61--75 (2020; Zbl 1443.90325) Full Text: DOI OpenURL
Abe, Fabio H. N.; Hoshino, Edna A.; Hill, Alessandro; Baldacci, Roberto A branch-and-price algorithm for the ring-tree facility location problem. (English) Zbl 07515164 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 3-14 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{F. H. N. Abe} et al., Electron. Notes Theor. Comput. Sci. 346, 3--14 (2019; Zbl 07515164) Full Text: DOI OpenURL
Jukna, Stasys; Seiwert, Hannes Greedy can beat pure dynamic programming. (English) Zbl 1469.68168 Inf. Process. Lett. 142, 90-95 (2019). MSC: 68W40 68R10 90C09 90C39 PDF BibTeX XML Cite \textit{S. Jukna} and \textit{H. Seiwert}, Inf. Process. Lett. 142, 90--95 (2019; Zbl 1469.68168) Full Text: DOI arXiv OpenURL
Morais, Vinicius; Gendron, Bernard; Mateus, Geraldo Robson The \(p\)-arborescence star problem: formulations and exact solution approaches. (English) Zbl 1458.90616 Comput. Oper. Res. 102, 91-101 (2019). MSC: 90C35 90B80 PDF BibTeX XML Cite \textit{V. Morais} et al., Comput. Oper. Res. 102, 91--101 (2019; Zbl 1458.90616) Full Text: DOI OpenURL
Kakimura, Naonori; Kamiyama, Naoyuki; Takazawa, Kenjiro The \(b\)-branching problem in digraphs. (English) Zbl 07378329 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 12, 15 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Kakimura} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 12, 15 p. (2018; Zbl 07378329) Full Text: DOI arXiv OpenURL
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems. (English) Zbl 1446.90060 INFORMS J. Comput. 30, No. 2, 402-420 (2018). MSC: 90B18 90C57 PDF BibTeX XML Cite \textit{M. Leitner} et al., INFORMS J. Comput. 30, No. 2, 402--420 (2018; Zbl 1446.90060) Full Text: DOI Link OpenURL
Abdi, Ahmad; Fukasawa, Ricardo; Sanità, Laura Opposite elements in clutters. (English) Zbl 1439.90018 Math. Oper. Res. 43, No. 2, 428-459 (2018). MSC: 90B10 90C27 PDF BibTeX XML Cite \textit{A. Abdi} et al., Math. Oper. Res. 43, No. 2, 428--459 (2018; Zbl 1439.90018) Full Text: DOI Link OpenURL
Gutin, Gregory Acyclic digraphs. (English) Zbl 1407.05110 Bang-Jensen, Jørgen (ed.) et al., Classes of directed graphs. Cham: Springer. Springer Monogr. Math., 125-172 (2018). MSC: 05C20 PDF BibTeX XML Cite \textit{G. Gutin}, in: Classes of directed graphs. Cham: Springer. 125--172 (2018; Zbl 1407.05110) Full Text: DOI OpenURL
Hayashi, Koyo; Iwata, Satoru Counting minimum weight arborescences. (English) Zbl 1401.05280 Algorithmica 80, No. 12, 3908-3919 (2018); erratum ibid. 81, No. 1, 418 (2019). MSC: 05C85 05C20 PDF BibTeX XML Cite \textit{K. Hayashi} and \textit{S. Iwata}, Algorithmica 80, No. 12, 3908--3919 (2018; Zbl 1401.05280) Full Text: DOI OpenURL
Chagas, Rosklin Juliano; Valle, Cristiano Arbex; da Cunha, Alexandre Salles Exact solution approaches for the multi-period degree constrained minimum spanning tree problem. (English) Zbl 1403.90632 Eur. J. Oper. Res. 271, No. 1, 57-71 (2018). MSC: 90C35 90C10 05C05 05C85 90C27 PDF BibTeX XML Cite \textit{R. J. Chagas} et al., Eur. J. Oper. Res. 271, No. 1, 57--71 (2018; Zbl 1403.90632) Full Text: DOI OpenURL
Newton, Jonathan Evolutionary game theory: a renaissance. (English) Zbl 1402.91053 Games 9, No. 2, Paper No. 31, 67 p. (2018). MSC: 91A22 91B14 91A05 91-02 PDF BibTeX XML Cite \textit{J. Newton}, Games 9, No. 2, Paper No. 31, 67 p. (2018; Zbl 1402.91053) Full Text: DOI OpenURL
Fischer, Anja; Fischer, Frank; McCormick, S. Thomas Matroid optimisation problems with nested non-linear monomials in the objective function. (English) Zbl 1419.90118 Math. Program. 169, No. 2 (A), 417-446 (2018). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. Fischer} et al., Math. Program. 169, No. 2 (A), 417--446 (2018; Zbl 1419.90118) Full Text: DOI OpenURL
Gutin, Gregory; Reidl, Felix; Wahlström, Magnus \(k\)-distinct in- and out-branchings in digraphs. (English) Zbl 1391.68054 J. Comput. Syst. Sci. 95, 86-97 (2018). MSC: 68Q25 05C20 PDF BibTeX XML Cite \textit{G. Gutin} et al., J. Comput. Syst. Sci. 95, 86--97 (2018; Zbl 1391.68054) Full Text: DOI arXiv OpenURL
Kusunoki, Yoshifumi; Tanino, Tetsuzo Investigation on irreducible cost vectors in minimum cost arborescence problems. (English) Zbl 1403.91214 Eur. J. Oper. Res. 261, No. 1, 214-221 (2017). MSC: 91B32 91A43 91A80 91A12 PDF BibTeX XML Cite \textit{Y. Kusunoki} and \textit{T. Tanino}, Eur. J. Oper. Res. 261, No. 1, 214--221 (2017; Zbl 1403.91214) Full Text: DOI OpenURL
Bahel, Eric; Trudeau, Christian Minimum incoming cost rules for arborescences. (English) Zbl 1392.91102 Soc. Choice Welfare 49, No. 2, 287-314 (2017). MSC: 91B32 91A43 91A12 PDF BibTeX XML Cite \textit{E. Bahel} and \textit{C. Trudeau}, Soc. Choice Welfare 49, No. 2, 287--314 (2017; Zbl 1392.91102) Full Text: DOI OpenURL
Graf, Daniel How to sort by walking and swapping on paths and trees. (English) Zbl 1372.68075 Algorithmica 78, No. 4, 1151-1181 (2017). MSC: 68P10 68Q17 68R05 68R10 68T40 68W05 PDF BibTeX XML Cite \textit{D. Graf}, Algorithmica 78, No. 4, 1151--1181 (2017; Zbl 1372.68075) Full Text: DOI OpenURL
Houndji, Vinasetan Ratheil; Schaus, Pierre; Hounkonnou, Mahouton Norbert; Wolsey, Laurence The weighted arborescence constraint. (English) Zbl 06756585 Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 185-201 (2017). MSC: 68R10 68T20 PDF BibTeX XML Cite \textit{V. R. Houndji} et al., Lect. Notes Comput. Sci. 10335, 185--201 (2017; Zbl 06756585) Full Text: DOI OpenURL
Gan, Tingyue; Cameron, Maria A graph-algorithmic approach for the study of metastability in Markov chains. (English) Zbl 1367.60097 J. Nonlinear Sci. 27, No. 3, 927-972 (2017). MSC: 60J27 60-08 PDF BibTeX XML Cite \textit{T. Gan} and \textit{M. Cameron}, J. Nonlinear Sci. 27, No. 3, 927--972 (2017; Zbl 1367.60097) Full Text: DOI arXiv OpenURL
Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanità, Laura On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. (English) Zbl 1360.90221 Math. Program. 160, No. 1-2 (A), 379-406 (2016). Reviewer: Vladimír Lacko (Košice) MSC: 90C27 68W25 PDF BibTeX XML Cite \textit{A. E. Feldmann} et al., Math. Program. 160, No. 1--2 (A), 379--406 (2016; Zbl 1360.90221) Full Text: DOI Link OpenURL
Li, Jianping; Guan, Li; Ding, Honglin; Li, Weidong Approximations for constructing tree-form structures using specific material with fixed length. (English) Zbl 1353.90169 Optim. Lett. 10, No. 6, 1337-1345 (2016). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{J. Li} et al., Optim. Lett. 10, No. 6, 1337--1345 (2016; Zbl 1353.90169) Full Text: DOI OpenURL
de Campos, Cassio P.; Corani, Giorgio; Scanagatta, Mauro; Cuccu, Marco; Zaffalon, Marco Learning extended tree augmented naive structures. (English) Zbl 1346.68169 Int. J. Approx. Reasoning 68, 153-163 (2016). MSC: 68T05 62H30 PDF BibTeX XML Cite \textit{C. P. de Campos} et al., Int. J. Approx. Reasoning 68, 153--163 (2016; Zbl 1346.68169) Full Text: DOI OpenURL
Graf, Daniel How to sort by walking on a tree. (English) Zbl 1369.68175 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48349-7/pbk; 978-3-662-48350-3/ebook). Lecture Notes in Computer Science 9294, 643-655 (2015). MSC: 68P10 68Q17 68R05 68R10 68T40 68W05 PDF BibTeX XML Cite \textit{D. Graf}, Lect. Notes Comput. Sci. 9294, 643--655 (2015; Zbl 1369.68175) Full Text: DOI OpenURL
Pastink, Arnoud; van der Gaag, Linda C. Multi-classifiers of small treewidth. (English) Zbl 1465.68227 Destercke, Sébastien (ed.) et al., Symbolic and quantitative approaches to reasoning with uncertainty. 13th European conference, ECSQARU 2015, Compiègne, France, July 15–17, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9161, 199-209 (2015). MSC: 68T05 62H22 62H30 PDF BibTeX XML Cite \textit{A. Pastink} and \textit{L. C. van der Gaag}, Lect. Notes Comput. Sci. 9161, 199--209 (2015; Zbl 1465.68227) Full Text: DOI Link OpenURL
Hansen, Thomas Dueholm; Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri Hollow heaps. (English) Zbl 1440.68050 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 689-700 (2015). MSC: 68P05 PDF BibTeX XML Cite \textit{T. D. Hansen} et al., Lect. Notes Comput. Sci. 9134, 689--700 (2015; Zbl 1440.68050) Full Text: DOI arXiv OpenURL
Gaspers, Serge; Koivisto, Mikko; Liedloff, Mathieu; Ordyniak, Sebastian; Szeider, Stefan On finding optimal polytrees. (English) Zbl 1330.68223 Theor. Comput. Sci. 592, 49-58 (2015). MSC: 68R10 05B35 68Q17 68Q25 PDF BibTeX XML Cite \textit{S. Gaspers} et al., Theor. Comput. Sci. 592, 49--58 (2015; Zbl 1330.68223) Full Text: DOI arXiv OpenURL
Benek Gursoy, Buket; Kirkland, Steve; Mason, Oliver; Sergeev, Sergeĭ The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields. (English) Zbl 1307.15053 Linear Algebra Appl. 468, 184-196 (2015). MSC: 15B51 16Y60 12K10 15A80 60J10 05C85 15A18 PDF BibTeX XML Cite \textit{B. Benek Gursoy} et al., Linear Algebra Appl. 468, 184--196 (2015; Zbl 1307.15053) Full Text: DOI arXiv OpenURL
Cimasoni, David The geometry of dimer models. (English) Zbl 1426.82005 Winter Braids Lect. Notes 1, Exp. No. 2, 14 p. (2014). MSC: 82B20 PDF BibTeX XML Cite \textit{D. Cimasoni}, Winter Braids Lect. Notes 1, Exp. No. 2, 14 p. (2014; Zbl 1426.82005) Full Text: DOI arXiv OpenURL
Carvalho, Alexandra M.; Adão, Pedro; Mateus, Paulo Hybrid learning of Bayesian multinets for binary classification. (English) Zbl 1373.68315 Pattern Recognition 47, No. 10, 3438-3450 (2014). MSC: 68T05 62H30 PDF BibTeX XML Cite \textit{A. M. Carvalho} et al., Pattern Recognition 47, No. 10, 3438--3450 (2014; Zbl 1373.68315) Full Text: DOI OpenURL
Björklund, Henrik; Björklund, Johanna; Zechner, Niklas Compression of finite-state automata through failure transitions. (English) Zbl 1338.68139 Theor. Comput. Sci. 557, 87-100 (2014). MSC: 68Q45 68Q17 68Q25 PDF BibTeX XML Cite \textit{H. Björklund} et al., Theor. Comput. Sci. 557, 87--100 (2014; Zbl 1338.68139) Full Text: DOI OpenURL
Kawatra, Rakesh A multiperiod min-sum arborescence problem. (English) Zbl 1332.90050 Opsearch 51, No. 4, 577-588 (2014). MSC: 90B10 90C59 90C10 PDF BibTeX XML Cite \textit{R. Kawatra}, Opsearch 51, No. 4, 577--588 (2014; Zbl 1332.90050) Full Text: DOI OpenURL
Andersson, T.; Erlanson, A.; Gudmundsson, J.; Habis, H.; Ingebretsen Carlson, J.; Kratz, J. A method for finding the maximal set in excess demand. (English) Zbl 1310.91088 Econ. Lett. 125, No. 1, 18-20 (2014). MSC: 91B42 91B50 PDF BibTeX XML Cite \textit{T. Andersson} et al., Econ. Lett. 125, No. 1, 18--20 (2014; Zbl 1310.91088) Full Text: DOI Link OpenURL
Carvalho, Alexandra M.; Adão, Pedro; Mateus, Paulo Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers. (English) Zbl 1398.94071 Entropy 15, No. 7, 2716-2735 (2013). MSC: 94A17 68T05 62H30 PDF BibTeX XML Cite \textit{A. M. Carvalho} et al., Entropy 15, No. 7, 2716--2735 (2013; Zbl 1398.94071) Full Text: DOI OpenURL
Fajardo, David; Gardner, Lauren M. Inferring contagion patterns in social contact networks with limited infection data. (English) Zbl 1332.92069 Netw. Spat. Econ. 13, No. 4, 399-426 (2013). MSC: 92D30 91D30 90C90 PDF BibTeX XML Cite \textit{D. Fajardo} and \textit{L. M. Gardner}, Netw. Spat. Econ. 13, No. 4, 399--426 (2013; Zbl 1332.92069) Full Text: DOI Link OpenURL
Carrabs, Francesco; Cerulli, Raffaele; Speranza, Maria Grazia A branch-and-bound algorithm for the double travelling salesman problem with two stacks. (English) Zbl 1269.90007 Networks 61, No. 1, 58-75 (2013). MSC: 90B06 90C35 PDF BibTeX XML Cite \textit{F. Carrabs} et al., Networks 61, No. 1, 58--75 (2013; Zbl 1269.90007) Full Text: DOI OpenURL
Hordijk, Wim; Broennimann, Olivier Dispersal routes reconstruction and the minimum cost arborescence problem. (English) Zbl 1411.92309 J. Theor. Biol. 308, 115-122 (2012). MSC: 92D40 PDF BibTeX XML Cite \textit{W. Hordijk} and \textit{O. Broennimann}, J. Theor. Biol. 308, 115--122 (2012; Zbl 1411.92309) Full Text: DOI OpenURL
Boria, Nicolas; Murat, Cécile; Paschos, Vangelis On the probabilistic min spanning tree problem. (English) Zbl 1382.05066 J. Math. Model. Algorithms 11, No. 1, 45-76 (2012). MSC: 05C80 60C05 68Q25 68R10 68W25 PDF BibTeX XML Cite \textit{N. Boria} et al., J. Math. Model. Algorithms 11, No. 1, 45--76 (2012; Zbl 1382.05066) Full Text: DOI HAL OpenURL
Kamiyama, Naoyuki Robustness of minimum cost arborescences. (English) Zbl 1254.90192 Japan J. Ind. Appl. Math. 29, No. 3, 485-497 (2012). MSC: 90C27 PDF BibTeX XML Cite \textit{N. Kamiyama}, Japan J. Ind. Appl. Math. 29, No. 3, 485--497 (2012; Zbl 1254.90192) Full Text: DOI OpenURL
Tanaka, Yuma; Imahori, Shinji; Sasaki, Mihiro; Yagiura, Mutsunori An LP-based heuristic algorithm for the node capacitated in-tree packing problem. (English) Zbl 1251.90377 Comput. Oper. Res. 39, No. 3, 637-646 (2012). MSC: 90C35 05C85 90C59 PDF BibTeX XML Cite \textit{Y. Tanaka} et al., Comput. Oper. Res. 39, No. 3, 637--646 (2012; Zbl 1251.90377) Full Text: DOI Link OpenURL
Hainke, Katrin; Rahnenführer, Jörg; Fried, Roland Cumulative disease progression models for cross-sectional data: a review and comparison. (English) Zbl 1400.62264 Biom. J. 54, No. 5, 617-640 (2012). MSC: 62P10 PDF BibTeX XML Cite \textit{K. Hainke} et al., Biom. J. 54, No. 5, 617--640 (2012; Zbl 1400.62264) Full Text: DOI OpenURL
Faigle, Ulrich; Kern, Walter; Peis, Britta A ranking model for the greedy algorithm and discrete convexity. (English) Zbl 1250.90073 Math. Program. 132, No. 1-2 (A), 393-407 (2012). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 90C57 90C59 PDF BibTeX XML Cite \textit{U. Faigle} et al., Math. Program. 132, No. 1--2 (A), 393--407 (2012; Zbl 1250.90073) Full Text: DOI OpenURL
Dutta, Bhaskar; Mishra, Debasis Minimum cost arborescences. (English) Zbl 1278.91090 Games Econ. Behav. 74, No. 1, 120-143 (2012). MSC: 91B32 91A80 91A43 91A12 PDF BibTeX XML Cite \textit{B. Dutta} and \textit{D. Mishra}, Games Econ. Behav. 74, No. 1, 120--143 (2012; Zbl 1278.91090) Full Text: DOI Link OpenURL
Babenko, Maxim A. An efficient scaling algorithm for the minimum weight bibranching problem. (English) Zbl 1275.68157 Algorithmica 61, No. 4, 898-922 (2011). MSC: 68W05 05C85 68Q25 PDF BibTeX XML Cite \textit{M. A. Babenko}, Algorithmica 61, No. 4, 898--922 (2011; Zbl 1275.68157) Full Text: DOI OpenURL
Chakrabarty, Deeparnab; Devanur, Nikhil R.; Vazirani, Vijay V. New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. (English) Zbl 1231.90364 Math. Program. 130, No. 1 (A), 1-32 (2011). Reviewer: Eleonor Ciurea (Braşov) MSC: 90C35 90C27 05C85 PDF BibTeX XML Cite \textit{D. Chakrabarty} et al., Math. Program. 130, No. 1 (A), 1--32 (2011; Zbl 1231.90364) Full Text: DOI OpenURL
Takazawa, Kenjiro Optimal matching forests and valuated delta-matroids. (English) Zbl 1341.90119 Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 404-416 (2011). MSC: 90C27 05B35 05C05 05C70 05C85 90C35 PDF BibTeX XML Cite \textit{K. Takazawa}, Lect. Notes Comput. Sci. 6655, 404--416 (2011; Zbl 1341.90119) Full Text: DOI Link OpenURL
Könemann, Jochen; Pritchard, David; Tan, Kunlun A partition-based relaxation for Steiner trees. (English) Zbl 1222.68413 Math. Program. 127, No. 2 (A), 345-370 (2011). Reviewer: Haiko Müller (Leeds) MSC: 68W25 68R10 90C27 PDF BibTeX XML Cite \textit{J. Könemann} et al., Math. Program. 127, No. 2 (A), 345--370 (2011; Zbl 1222.68413) Full Text: DOI OpenURL
Jain, Kamal; Vazirani, Vijay V. Eisenberg-Gale markets: algorithms and game-theoretic properties. (English) Zbl 1201.91110 Games Econ. Behav. 70, No. 1, 84-106 (2010). Reviewer: George Stoica (Saint John) MSC: 91B50 90B10 90C33 90C25 PDF BibTeX XML Cite \textit{K. Jain} and \textit{V. V. Vazirani}, Games Econ. Behav. 70, No. 1, 84--106 (2010; Zbl 1201.91110) Full Text: DOI OpenURL
Pęski, Marcin Generalized risk-dominance and asymmetric dynamics. (English) Zbl 1202.91008 J. Econ. Theory 145, No. 1, 216-248 (2010); corrigendum ibid. 154, 668-669 (2014). MSC: 91A06 91A15 91A22 PDF BibTeX XML Cite \textit{M. Pęski}, J. Econ. Theory 145, No. 1, 216--248 (2010; Zbl 1202.91008) Full Text: DOI Link OpenURL
Hougardy, Stefan Linear time approximation algorithms for degree constrained subgraph problems. (English) Zbl 1359.90119 Cook, William J. (ed.) et al., Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer (ISBN 978-3-540-76795-4/hbk). 185-200 (2009). MSC: 90C27 90C60 05C85 68W25 90C35 PDF BibTeX XML Cite \textit{S. Hougardy}, in: Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer. 185--200 (2009; Zbl 1359.90119) Full Text: DOI Link OpenURL
Ziegler, Valentin Approximating optimum branchings in linear time. (English) Zbl 1191.68879 Inf. Process. Lett. 109, No. 3, 175-178 (2009). MSC: 68W25 68R10 05C85 PDF BibTeX XML Cite \textit{V. Ziegler}, Inf. Process. Lett. 109, No. 3, 175--178 (2009; Zbl 1191.68879) Full Text: DOI OpenURL
Bang-Jensen, Jørgen Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. (English) Zbl 1207.05067 Discrete Math. 309, No. 18, 5655-5667 (2009). MSC: 05C20 05C40 05C38 05C05 PDF BibTeX XML Cite \textit{J. Bang-Jensen}, Discrete Math. 309, No. 18, 5655--5667 (2009; Zbl 1207.05067) Full Text: DOI OpenURL
Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund Beyond Moulin mechanisms. (English) Zbl 1168.91314 Games Econ. Behav. 67, No. 1, 125-155 (2009). MSC: 91A12 91A20 91B14 PDF BibTeX XML Cite \textit{A. Mehta} et al., Games Econ. Behav. 67, No. 1, 125--155 (2009; Zbl 1168.91314) Full Text: DOI OpenURL
Liao, Chung-Shou; Zhang, Louxin Approximating the spanning \(k\)-tree forest problem. (English) Zbl 1248.68562 Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 293-301 (2009). MSC: 68W25 68R10 PDF BibTeX XML Cite \textit{C.-S. Liao} and \textit{L. Zhang}, Lect. Notes Comput. Sci. 5598, 293--301 (2009; Zbl 1248.68562) Full Text: DOI OpenURL
Cohen, Reuven; Fraigniaud, Pierre; Ilcinkas, David; Korman, Amos; Peleg, David Labeling schemes for tree representation. (English) Zbl 1171.68599 Algorithmica 53, No. 1, 1-15 (2009). MSC: 68R10 PDF BibTeX XML Cite \textit{R. Cohen} et al., Algorithmica 53, No. 1, 1--15 (2009; Zbl 1171.68599) Full Text: DOI HAL OpenURL
Ziegler, Valentin Approximation algorithms for restricted Bayesian network structures. (English) Zbl 1191.68878 Inf. Process. Lett. 108, No. 2, 60-63 (2008). MSC: 68W25 68T05 PDF BibTeX XML Cite \textit{V. Ziegler}, Inf. Process. Lett. 108, No. 2, 60--63 (2008; Zbl 1191.68878) Full Text: DOI OpenURL
Duhamel, Christophe; Gouveia, Luis; Moura, Pedro; Souza, Mauricio Models and heuristics for a minimum arborescence problem. (English) Zbl 1175.90059 Networks 51, No. 1, 34-47 (2008). MSC: 90B10 90C05 90C59 PDF BibTeX XML Cite \textit{C. Duhamel} et al., Networks 51, No. 1, 34--47 (2008; Zbl 1175.90059) Full Text: DOI OpenURL
Flammini, Michele; Klasing, Ralf; Navarra, Alfredo; Perennes, Stephane Improved approximation results for the minimum energy broadcasting problem. (English) Zbl 1169.68313 Algorithmica 49, No. 4, 318-336 (2007). MSC: 68M10 PDF BibTeX XML Cite \textit{M. Flammini} et al., Algorithmica 49, No. 4, 318--336 (2007; Zbl 1169.68313) Full Text: DOI OpenURL
Vo, Binh Dao; Vo, Kiem-Phong Compressing table data with column dependency. (English) Zbl 1144.68025 Theor. Comput. Sci. 387, No. 3, 273-283 (2007). MSC: 68P30 68P10 PDF BibTeX XML Cite \textit{B. D. Vo} and \textit{K.-P. Vo}, Theor. Comput. Sci. 387, No. 3, 273--283 (2007; Zbl 1144.68025) Full Text: DOI OpenURL
Conde, Eduardo; Candia, Alfredo Minimax regret spanning arborescences under uncertain costs. (English) Zbl 1178.90053 Eur. J. Oper. Res. 182, No. 2, 561-577 (2007). MSC: 90B10 PDF BibTeX XML Cite \textit{E. Conde} and \textit{A. Candia}, Eur. J. Oper. Res. 182, No. 2, 561--577 (2007; Zbl 1178.90053) Full Text: DOI OpenURL
Conde, Eduardo A branch and bound algorithm for the minimax regret spanning arborescence. (English) Zbl 1156.90027 J. Glob. Optim. 37, No. 3, 467-480 (2007). MSC: 90C57 90C35 90C27 90C47 PDF BibTeX XML Cite \textit{E. Conde}, J. Glob. Optim. 37, No. 3, 467--480 (2007; Zbl 1156.90027) Full Text: DOI OpenURL
Feigenbaum, Joan; Sami, Rahul; Shenker, Scott Mechanism design for policy routing. (English) Zbl 1266.68036 Distrib. Comput. 18, No. 4, 293-305 (2006). MSC: 68M11 68Q17 PDF BibTeX XML Cite \textit{J. Feigenbaum} et al., Distrib. Comput. 18, No. 4, 293--305 (2006; Zbl 1266.68036) Full Text: DOI Link OpenURL
Angel, Eric; Bampis, Evripidis; Blin, Lélia; Gourvès, Laurent Fair cost-sharing methods for the minimum spanning tree game. (English) Zbl 1185.91056 Inf. Process. Lett. 100, No. 1, 29-35 (2006). MSC: 91A43 91A12 91B32 PDF BibTeX XML Cite \textit{E. Angel} et al., Inf. Process. Lett. 100, No. 1, 29--35 (2006; Zbl 1185.91056) Full Text: DOI HAL OpenURL
Barahona, Francisco; Ladányi, László Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. (English) Zbl 1146.90090 RAIRO, Oper. Res. 40, No. 1, 53-73 (2006). Reviewer: Paolo Nobili (Lecce) MSC: 90C57 90C27 90C35 PDF BibTeX XML Cite \textit{F. Barahona} and \textit{L. Ladányi}, RAIRO, Oper. Res. 40, No. 1, 53--73 (2006; Zbl 1146.90090) Full Text: DOI Numdam EuDML Link OpenURL
Bilò, V.; Flammini, M.; Melideo, G.; Moscardelli, L.; Navarra, A. Sharing the cost of multicast transmissions in wireless networks. (English) Zbl 1110.68005 Theor. Comput. Sci. 369, No. 1-3, 269-284 (2006). MSC: 68M10 90B18 94A05 PDF BibTeX XML Cite \textit{V. Bilò} et al., Theor. Comput. Sci. 369, No. 1--3, 269--284 (2006; Zbl 1110.68005) Full Text: DOI OpenURL
Candia-Véjar, Alfredo; Bravo-Azlán, Hugo Worst-case performance of Wong’s Steiner tree heuristic. (English) Zbl 1120.90045 Discrete Appl. Math. 154, No. 5, 730-737 (2006). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{A. Candia-Véjar} and \textit{H. Bravo-Azlán}, Discrete Appl. Math. 154, No. 5, 730--737 (2006; Zbl 1120.90045) Full Text: DOI OpenURL
Leonardi, Stefano; Schäfer, Guido Cross-monotonic cost sharing methods for connected facility location games. (English) Zbl 1071.90023 Theor. Comput. Sci. 326, No. 1-3, 431-442 (2004). MSC: 90B80 68W20 68W25 91A43 91B32 PDF BibTeX XML Cite \textit{S. Leonardi} and \textit{G. Schäfer}, Theor. Comput. Sci. 326, No. 1--3, 431--442 (2004; Zbl 1071.90023) Full Text: DOI Link OpenURL
Georgiadis, Leonidas Arborescence optimization problems solvable by Edmonds’ algorithm. (English) Zbl 1022.68097 Theor. Comput. Sci. 301, No. 1-3, 427-437 (2003). MSC: 68R10 PDF BibTeX XML Cite \textit{L. Georgiadis}, Theor. Comput. Sci. 301, No. 1--3, 427--437 (2003; Zbl 1022.68097) Full Text: DOI OpenURL
Kar, Anirban Axiomatization of the Shapley value on minimum cost spanning tree games. (English) Zbl 1035.91007 Games Econ. Behav. 38, No. 2, 265-277 (2002). Reviewer: Salvatore Modica (Palermo) MSC: 91A12 91A43 PDF BibTeX XML Cite \textit{A. Kar}, Games Econ. Behav. 38, No. 2, 265--277 (2002; Zbl 1035.91007) Full Text: DOI OpenURL
Szabo, Aniko; Boucher, Kenneth Estimating an oncogenetic tree when false negatives and positives are present. (English) Zbl 1007.92020 Math. Biosci. 176, No. 2, 219-236 (2002). MSC: 92C50 PDF BibTeX XML Cite \textit{A. Szabo} and \textit{K. Boucher}, Math. Biosci. 176, No. 2, 219--236 (2002; Zbl 1007.92020) Full Text: DOI OpenURL
Toth, Paolo Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems. (English) Zbl 0969.90075 Eur. J. Oper. Res. 125, No. 2, 222-238 (2000). MSC: 90C27 90C09 90C35 PDF BibTeX XML Cite \textit{P. Toth}, Eur. J. Oper. Res. 125, No. 2, 222--238 (2000; Zbl 0969.90075) Full Text: DOI OpenURL
Vazirani, Vijay V. Recent results on approximating the Steiner tree problem and its generalizations. (English) Zbl 0953.68120 Theor. Comput. Sci. 235, No. 1, 205-216 (2000). MSC: 68R10 PDF BibTeX XML Cite \textit{V. V. Vazirani}, Theor. Comput. Sci. 235, No. 1, 205--216 (2000; Zbl 0953.68120) Full Text: DOI OpenURL
Kataoka, Seiji; Yamada, Takeo; Morito, Sususmu Minimum directed 1-subtree relaxation for score orienteering problem. (English) Zbl 0955.90108 Eur. J. Oper. Res. 104, No. 1, 139-153 (1998). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{S. Kataoka} et al., Eur. J. Oper. Res. 104, No. 1, 139--153 (1998; Zbl 0955.90108) Full Text: DOI OpenURL
Keijsper, J.; Pendavingh, R. An efficient algorithm for minimum-weight bibranching. (English) Zbl 0916.05065 J. Comb. Theory, Ser. B 73, No. 2, 130-145 (1998). Reviewer: Z.Chen (Indianapolis) MSC: 05C85 05C20 05C70 PDF BibTeX XML Cite \textit{J. Keijsper} and \textit{R. Pendavingh}, J. Comb. Theory, Ser. B 73, No. 2, 130--145 (1998; Zbl 0916.05065) Full Text: DOI OpenURL
Hu, Zhiquan; Liu, Zhenhong A strongly polynomial algorithm for the inverse shortest arborescence problem. (English) Zbl 0897.90188 Discrete Appl. Math. 82, No. 1-3, 135-154 (1998). MSC: 90C35 68R10 PDF BibTeX XML Cite \textit{Z. Hu} and \textit{Z. Liu}, Discrete Appl. Math. 82, No. 1--3, 135--154 (1998; Zbl 0897.90188) Full Text: DOI Link OpenURL
Dell’Amico, Mauro; Maffioli, Francesco On some multicriteria arborescence problems: Complexity and algorithms. (English) Zbl 0854.68042 Discrete Appl. Math. 65, No. 1-3, 191-206 (1996). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{M. Dell'Amico} and \textit{F. Maffioli}, Discrete Appl. Math. 65, No. 1--3, 191--206 (1996; Zbl 0854.68042) Full Text: DOI OpenURL
Gouveia, Luis Multicommodity flow models for spanning trees with hop constraints. (English) Zbl 0947.90513 Eur. J. Oper. Res. 95, No. 1, 178-190 (1996). MSC: 90B25 90C05 PDF BibTeX XML Cite \textit{L. Gouveia}, Eur. J. Oper. Res. 95, No. 1, 178--190 (1996; Zbl 0947.90513) Full Text: DOI OpenURL
Gouveia, Luis Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints. (English) Zbl 0854.90139 Comput. Oper. Res. 22, No. 9, 959-970 (1995). MSC: 90C35 PDF BibTeX XML Cite \textit{L. Gouveia}, Comput. Oper. Res. 22, No. 9, 959--970 (1995; Zbl 0854.90139) Full Text: DOI OpenURL
Toth, Paolo; Vigo, Daniele An exact algorithm for the capacitated shortest spanning arborescence. (English) Zbl 0844.90104 Ann. Oper. Res. 61, 121-141 (1995). MSC: 90C35 93C10 PDF BibTeX XML Cite \textit{P. Toth} and \textit{D. Vigo}, Ann. Oper. Res. 61, 121--141 (1995; Zbl 0844.90104) Full Text: DOI OpenURL