×

Found 947 Documents (Results 1–100)

100
MathJax

Construction of the current Steiner network of the second optimality rank. (English. Russian original) Zbl 1471.65045

J. Math. Sci., New York 253, No. 4, 488-499 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 154, 32-42 (2018).
MSC:  65K05 68R10
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

Computing directed Steiner path covers for directed co-graphs (extended abstract). (English) Zbl 1440.68188

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 556-565 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane. (English) Zbl 07515214

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, 589-601 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

Semigraphs. (English) Zbl 1459.05217

Sampathkumar, E. (ed.), Semigraphs and their applications. With the cooperation of C. M. Deshpande, B. Y. Bam, L. Pushpalatha and V. Swaminathan. Karnataka: Academy of Discrete Mathematics and Applications. 1-16 (2019).
MSC:  05C62 05C65 05C50
PDF BibTeX XML Cite

A simple algorithm to triangulate a special class of 3d non-convex polyhedra without Steiner points. (English) Zbl 1445.68265

Garanzha, Vladimir A. (ed.) et al., Numerical geometry, grid generation and scientific computing. Proceedings of the 9th international conference, NUMGRID 2018 / Voronoi 150, celebrating the 150th anniversary of G.F. Voronoi, Moscow, Russia, December 3–5, 2018. Cham: Springer. Lect. Notes Comput. Sci. Eng. 131, 61-71 (2019).
MSC:  68U05 51M20 68W40
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

\(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

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

ETH-hardness of approximating 2-CSPs and directed Steiner network. (English) Zbl 1462.68068

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 36, 20 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

A local-search algorithm for Steiner forest. (English) Zbl 1462.68140

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 31, 17 p. (2018).
MSC:  68R10 68W25
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

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