Image de couverture de livre

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sun, Ming, Wu, Xinyu, Zhou, Yi, Hao, Jin-Kao, Fu, Zhang-Hua
Format:	Preprint
Publié:	2022
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

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

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

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

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

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

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

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

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

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)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

Three Algorithms for Merging Hierarchical Navigable Small World Graphs
par: Ponomarenko, Alexander
Publié: (2025)

Algorithmic Problems in Categories of Partitions
par: Faroß, Nicolas, et autres
Publié: (2025)

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

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

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
par: Hao, Yimin, et autres
Publié: (2025)

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

A Reduction-based Algorithm for the Clique Interdiction Problem
par: Zhu, Chenghao, et autres
Publié: (2025)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Learning to Prune Instances of Steiner Tree Problem in Graphs
par: Zhang, Jiwei, et autres
Publié: (2022)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
par: D'Angelo, Gianlorenzo, et autres
Publié: (2025)

The Bichromatic Two-Center Problem on Graphs
par: Sun, Qi, et autres
Publié: (2025)

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

Sum-of-Max Chain Partition of a Tree
par: Luo, Ruixi, et autres
Publié: (2025)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
par: Joshi, Amit
Publié: (2025)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
par: Zhu, Chenghao, et autres
Publié: (2025)

Graph Partitioning With Limited Moves
par: Behbahani, Majid, et autres
Publié: (2024)

Perfect Simulation of Las Vegas Algorithms via Local Computation
par: Fu, Xinyu, et autres
Publié: (2023)

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

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

DNA Probe Computing System for Solving NP-Complete Problems
par: Xu, Jin, et autres
Publié: (2025)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)

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

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
par: Xu, Chao, et autres
Publié: (2026)

Tera-Scale Multilevel Graph Partitioning
par: Salwasser, Daniel, et autres
Publié: (2024)

Terminal Steiner tree problem : Complexity and Algorithms
par: S, Jyothish, et autres
Publié: (2026)

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