×

Found 878 Documents (Results 1–100)

100
MathJax

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
Full Text: DOI

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).
PDF BibTeX XML Cite
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI Link

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
Full Text: DOI arXiv

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
Full Text: DOI HAL

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
Full Text: DOI

\(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).
PDF BibTeX XML Cite
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDF BibTeX XML Cite
Full Text: DOI arXiv

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).
PDF BibTeX XML Cite
Full Text: DOI Link

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).
PDF BibTeX XML Cite
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software