Image de couverture de livre

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bläsius, Thomas, Csöre, Henrik, Göttlicher, Max, Schmidt, Elly, Yi, Wendy
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

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
par: Bläsius, Thomas, et autres
Publié: (2024)

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

The Steiner Shortest Path Tree Problem
par: Asher, Omer, et autres
Publié: (2025)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
par: Bartlmae, Simon, et autres
Publié: (2024)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
par: Mahabadi, Sepideh, et autres
Publié: (2024)

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

Diameter Computation on (Random) Geometric Graphs
par: Bläsius, Thomas, et autres
Publié: (2026)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
par: Disser, Yann, et autres
Publié: (2024)

Sublinear Metric Steiner Forest via Maximal Independent Set
par: Mahabadi, Sepideh, et autres
Publié: (2025)

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

Lower Bounds on Flow Sparsifiers with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2026)

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

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
par: Mahapatra, Sugyani, et autres
Publié: (2021)

Multi-Level Steiner Trees
par: Ahmed, Reyan, et autres
Publié: (2018)

On the External Validity of Average-Case Analyses of Graph Algorithms
par: Bläsius, Thomas, et autres
Publié: (2022)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
par: Borst, Sander, et autres
Publié: (2024)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
par: Held, Stephan, et autres
Publié: (2025)

Prize-Collecting Steiner Tree: A 1.79 Approximation
par: Ahmadi, Ali, et autres
Publié: (2024)

Online Steiner Forest with Recourse
par: Long, Yaowei, et autres
Publié: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Optimal Sensitivity Oracle for Steiner Mincut
par: Bhanja, Koustav
Publié: (2024)

Streaming Algorithms for Geometric Steiner Forest
par: Czumaj, Artur, et autres
Publié: (2020)

Graph Spanners for Group Steiner Distances
par: Bilò, Davide, et autres
Publié: (2024)

DAG Covers: The Steiner Point Effect
par: Bhore, Sujoy, et autres
Publié: (2026)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
par: Geis, Lukas, et autres
Publié: (2024)

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
par: Haeupler, Bernhard, et autres
Publié: (2025)

Smoothed Analysis of Online Metric Problems
par: Coester, Christian, et autres
Publié: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

2-Approximation for Prize-Collecting Steiner Forest
par: Ahmadi, Ali, et autres
Publié: (2023)

Lower Bounds on $0$-Extension with Steiner Nodes
par: Chen, Yu, et autres
Publié: (2024)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
par: Paschmanns, Paul, et autres
Publié: (2026)

Effective Traveling for Metric Instances of the Traveling Thief Problem
par: Eube, Jan, et autres
Publié: (2026)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
par: Groenland, Carla, et autres
Publié: (2024)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
par: Bhanja, Koustav, et autres
Publié: (2025)