Image de couverture de livre

The Steiner Shortest Path Tree Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asher, Omer, Dinitz, Yefim, Dolev, Shlomi, Raviv, Li-on, Schieber, Baruch
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
par: Dolev, Shlomi
Publié: (2025)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
par: Makarychev, Yury, et autres
Publié: (2024)

The Steiner Path Aggregation Problem
par: Chen, Da Qi, et autres
Publié: (2025)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
par: Tong, Guangmo, et autres
Publié: (2024)

Tree Search With Predictions
par: Dinitz, Michael, et autres
Publié: (2026)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
par: Choudhary, Keerti, et autres
Publié: (2025)

The Discrepancy of Shortest Paths
par: Bodwin, Greg, et autres
Publié: (2024)

Optimal Preprocessing for Answering On-Line Product Queries
par: Alon, Noga, et autres
Publié: (2024)

Shortcutting for Negative-Weight Shortest Path
par: Li, George Z., et autres
Publié: (2025)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
par: Dinitz, Michael, et autres
Publié: (2025)

Approximations and Hardness of Packing Partially Ordered Items
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Shortest Paths in Multimode Graphs
par: Kirkpatrick, Yael, et autres
Publié: (2025)

On Constrained and k Shortest Paths
par: Bendahi, Abderrahim, et autres
Publié: (2024)

All-Hops Shortest Paths
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Query Complexity of the Metric Steiner Tree Problem
par: Chen, Yu, et autres
Publié: (2022)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

Controlling tail risk in two-slope ski rental
par: Cui, Qiming, et autres
Publié: (2025)

Hierarchical Multicriteria Shortest Path Search
par: Kurbanov, Temirlan, et autres
Publié: (2025)

Covering Approximate Shortest Paths with DAGs
par: Assadi, Sepehr, et autres
Publié: (2025)

Verifying Shortest Paths in Linear Time
par: Shokry, Ahmed, et autres
Publié: (2024)

Enhanced Methods for the Weight Constrained Shortest Path Problem
par: Ahmadi, Saman, et autres
Publié: (2022)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
par: Chen, Kuowen, et autres
Publié: (2025)

Hardness of Approximation for Shortest Path with Vector Costs
par: Carlson, Charlie, et autres
Publié: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
par: Górkiewicz, Adam, et autres
Publié: (2025)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Breaking the Bellman-Ford Shortest-Path Bound
par: Elmasry, Amr
Publié: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
par: Li, Jason, et autres
Publié: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
par: Pilipczuk, Michał, et autres
Publié: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
par: An, Shinwoo, et autres
Publié: (2025)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
par: Bläsius, Thomas, et autres
Publié: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
par: Dey, Palash, et autres
Publié: (2023)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
par: Chekuri, Chandra, et autres
Publié: (2024)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
par: Haeupler, Bernhard, et autres
Publié: (2025)

Improved 2-Approximate Shortest Paths for close vertex pairs
par: Gupta, Manoj
Publié: (2025)

All-Pairs Shortest Paths with Few Weights per Node
par: Abboud, Amir, et autres
Publié: (2025)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
par: Chitnis, Rajesh, et autres
Publié: (2024)