Document Search Results

Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav

An ETH-tight algorithm for bidirected Steiner connectivity. (English) Zbl 07789730

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 588-604 (2023).

MSC: 68P05 68Wxx

Cite Review PDF

Full Text: DOI

Hernández-López, Eymard; Wences, Giovanni

Optimization of urban transport; an alternative to checkerboard towns plans. (English) Zbl 1541.49028

Discrete Math. Algorithms Appl. 15, No. 7, Article ID 2250156, 20 p. (2023).

MSC: 49Q22 60K30 90B10 90B15 62P30 62G10

Cite Review PDF

Full Text: DOI

Bhore, Sujoy; Carmi, Paz; Kolay, Sudeshna; Zehavi, Meirav

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079

Algorithmica 85, No. 1, 133-152 (2023).

MSC: 68Wxx 05Cxx

Cite Review PDF

Full Text: DOI arXiv

Ljubić, Ivana

Solving Steiner trees: recent advances, challenges, and perspectives. (English) Zbl 1535.90131

Networks 77, No. 2, 177-204 (2021).

MSC: 90C27 90C35

Cite Review PDF

Full Text: DOI

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

Cite Review PDF

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

Cite Review PDF

Full Text: DOI arXiv

Eiben, Eduard; Knop, Dušan; Panolan, Fahad; Suchý, Ondřej

Complexity of the Steiner network problem with respect to the number of terminals. (English) Zbl 07559134

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 25, 17 p. (2019).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI arXiv

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

Cite Review PDF

Full Text: DOI

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

Cite Review PDF

Full Text: DOI

Hougardy, Stefan; Silvanus, Jannik; Vygen, Jens

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. (English) Zbl 1387.05252

Math. Program. Comput. 9, No. 2, 135-202 (2017).

MSC: 05C85 68W35 90C27 90C39

Cite Review PDF

Full Text: DOI arXiv

Suchý, Ondřej

Extending the kernel for planar Steiner tree to the number of Steiner vertices. (English) Zbl 1372.68146

Algorithmica 79, No. 1, 189-210 (2017).

MSC: 68Q25 05C10 05C85 68R10

Cite Review PDF

Full Text: DOI Link

Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej

Parameterized complexity of directed Steiner tree on sparse graphs. (English) Zbl 1371.68115

SIAM J. Discrete Math. 31, No. 2, 1294-1327 (2017).

MSC: 68Q25 05C83 05C85

Cite Review PDF

Full Text: DOI

Suchý, Ondřej

On directed Steiner trees with multiple roots. (English) Zbl 1417.05089

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 257-268 (2016).

MSC: 05C20 05C05 05C85 68Q17 68Q25

Cite Review PDF

Full Text: DOI arXiv

Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket

Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1433.05299

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, 494-505 (2015).

MSC: 05C85 05C22 05C40 68Q25 68W05 68W40

Cite Review PDF

Full Text: DOI Link

Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique

An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes. (English) Zbl 1302.68222

Inf. Process. Lett. 115, No. 2, 275-279 (2015).

MSC: 68R10 05C85 68Q25

Cite Review PDF

Full Text: DOI

Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket

Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049

Algorithmica 65, No. 3, 584-604 (2013).

MSC: 05C22 05C35 05C05 05C85 90C39

Cite Review PDF

Full Text: DOI Link

Nederlof, Jesper

Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems. (English) Zbl 1272.68148

Algorithmica 65, No. 4, 868-884 (2013).

MSC: 68Q17 05C85 68R10

Cite Review PDF

Full Text: DOI

OA License

Weng, J. F.; Mareels, I.; Thomas, D. A.

Probability Steiner trees and maximum parsimony in phylogenetic analysis. (English) Zbl 1279.92061

J. Math. Biol. 64, No. 7, 1225-1251 (2012).

MSC: 92D15 05C05 60C05

Cite Review PDF

Full Text: DOI

Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket

Sharp separation and applications to exact and parameterized algorithms. (English) Zbl 1236.68090

Algorithmica 63, No. 3, 692-706 (2012).

MSC: 68Q17 05C85 68R10

Cite Review PDF

Full Text: DOI

Vygen, Jens

Faster algorithm for optimum Steiner trees. (English) Zbl 1260.68305

Inf. Process. Lett. 111, No. 21-22, 1075-1079 (2011).

MSC: 68R10 05C85 05C05 05C22 90C39

Cite Review PDF

Full Text: DOI

Polzin, Tobias; Vahdati-Daneshmand, Siavash

Approaches to the Steiner problem in networks. (English) Zbl 1248.68069

Lerner, Jürgen (ed.) et al., Algorithmics of large and complex networks. Design, analysis, and simulation. Berlin: Springer (ISBN 978-3-642-02093-3/pbk). Lecture Notes in Computer Science 5515, 81-103 (2009).

MSC: 68M10 68R10 68T20 68W25 90C35 90C59

Cite Review PDF

Full Text: DOI

Fernau, Henning; Manlove, David F.

Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342

J. Discrete Algorithms 7, No. 2, 149-167 (2009).

MSC: 68R10 68W25 68Q25 05C85

Cite Review PDF

Full Text: DOI

Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter

Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 430-441 (2008).

MSC: 68R10 68Q25 90C35

Cite Review PDF

Full Text: DOI

Fuchs, Bernhard; Kern, Walter; Wang, Xinhui

**The number of tree stars is \(O^{*}(1.357^k)\).** (English) Zbl 1131.68071

Algorithmica 49, No. 3, 232-244 (2007).

MSC: 68R10 05C05 68U05

Cite Review PDF

Full Text: DOI

OA License

Found 24 Documents (Results 1–24)

An ETH-tight algorithm for bidirected Steiner connectivity. (English) Zbl 07789730

Optimization of urban transport; an alternative to checkerboard towns plans. (English) Zbl 1541.49028

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079

Solving Steiner trees: recent advances, challenges, and perspectives. (English) Zbl 1535.90131

Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1462.68138

Approximation algorithms for Steiner tree based on star contractions: a unified view. (English) Zbl 07764107

Complexity of the Steiner network problem with respect to the number of terminals. (English) Zbl 07559134

Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1404.05208

Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. (English) Zbl 1396.90016

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. (English) Zbl 1387.05252

Extending the kernel for planar Steiner tree to the number of Steiner vertices. (English) Zbl 1372.68146

Parameterized complexity of directed Steiner tree on sparse graphs. (English) Zbl 1371.68115

On directed Steiner trees with multiple roots. (English) Zbl 1417.05089

Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1433.05299

An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes. (English) Zbl 1302.68222

Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049

Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems. (English) Zbl 1272.68148

Probability Steiner trees and maximum parsimony in phylogenetic analysis. (English) Zbl 1279.92061

Sharp separation and applications to exact and parameterized algorithms. (English) Zbl 1236.68090

Faster algorithm for optimum Steiner trees. (English) Zbl 1260.68305

Approaches to the Steiner problem in networks. (English) Zbl 1248.68069

Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342

Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429

**The number of tree stars is \(O^{*}(1.357^k)\).** (English) Zbl 1131.68071

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field

Software

Found 24 Documents (Results 1–24)

An ETH-tight algorithm for bidirected Steiner connectivity. (English) Zbl 07789730

Optimization of urban transport; an alternative to checkerboard towns plans. (English) Zbl 1541.49028

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07677079

Solving Steiner trees: recent advances, challenges, and perspectives. (English) Zbl 1535.90131

Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1462.68138

Approximation algorithms for Steiner tree based on star contractions: a unified view. (English) Zbl 07764107

Complexity of the Steiner network problem with respect to the number of terminals. (English) Zbl 07559134

Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1404.05208

Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. (English) Zbl 1396.90016

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. (English) Zbl 1387.05252

Extending the kernel for planar Steiner tree to the number of Steiner vertices. (English) Zbl 1372.68146

Parameterized complexity of directed Steiner tree on sparse graphs. (English) Zbl 1371.68115

On directed Steiner trees with multiple roots. (English) Zbl 1417.05089

Parameterized single-exponential time polynomial space algorithm for Steiner tree. (English) Zbl 1433.05299

An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes. (English) Zbl 1302.68222

Computing optimal Steiner trees in polynomial space. (English) Zbl 1269.05049

Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems. (English) Zbl 1272.68148

Probability Steiner trees and maximum parsimony in phylogenetic analysis. (English) Zbl 1279.92061

Sharp separation and applications to exact and parameterized algorithms. (English) Zbl 1236.68090

Faster algorithm for optimum Steiner trees. (English) Zbl 1260.68305

Approaches to the Steiner problem in networks. (English) Zbl 1248.68069

Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342

Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429

The number of tree stars is \(O^{*}(1.357^k)\). (English) Zbl 1131.68071

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field

Software

**The number of tree stars is \(O^{*}(1.357^k)\).** (English) Zbl 1131.68071