Imagen de Portada

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chekuri, Chandra, Jain, Rhea, Kulkarni, Shubhang, Zheng, Da Wei, Zhu, Weihao
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
por: Chekuri, Chandra, et al.
Publicado: (2024)

Online Disjoint Spanning Trees and Polymatroid Bases
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

On Sparsest Cut and Conductance in Directed Polymatroidal Networks
por: Chekuri, Chandra, et al.
Publicado: (2024)

Node-Weighted Multicut in Planar Digraphs
por: Chekuri, Chandra, et al.
Publicado: (2026)

Hedgegraph Polymatroids
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
por: Chekuri, Chandra, et al.
Publicado: (2024)

Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Multi-Level Steiner Trees
por: Ahmed, Reyan, et al.
Publicado: (2018)

DAG Covers: The Steiner Point Effect
por: Bhore, Sujoy, et al.
Publicado: (2026)

The Steiner Path Aggregation Problem
por: Chen, Da Qi, et al.
Publicado: (2025)

The Steiner Shortest Path Tree Problem
por: Asher, Omer, et al.
Publicado: (2025)

Graph Spanners for Group Steiner Distances
por: Bilò, Davide, et al.
Publicado: (2024)

Query Complexity of the Metric Steiner Tree Problem
por: Chen, Yu, et al.
Publicado: (2022)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
por: Sun, Ming, et al.
Publicado: (2022)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
por: Feldmann, Andreas Emil, et al.
Publicado: (2024)

Prize-Collecting Steiner Tree: A 1.79 Approximation
por: Ahmadi, Ali, et al.
Publicado: (2024)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
por: Held, Stephan, et al.
Publicado: (2025)

Online Steiner Forest with Recourse
por: Long, Yaowei, et al.
Publicado: (2026)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
por: Mahabadi, Sepideh, et al.
Publicado: (2024)

Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
por: Bläsius, Thomas, et al.
Publicado: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
por: Bhore, Sujoy, et al.
Publicado: (2025)

Colorful Priority $k$-Supplier
por: Chekuri, Chandra, et al.
Publicado: (2024)

Optimal Sensitivity Oracle for Steiner Mincut
por: Bhanja, Koustav
Publicado: (2024)

Approximation Algorithms for Steiner Connectivity Augmentation
por: Hathcock, Daniel, et al.
Publicado: (2023)

Streaming Algorithms for Geometric Steiner Forest
por: Czumaj, Artur, et al.
Publicado: (2020)

Lower Bounds on $0$-Extension with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2024)

2-Approximation for Prize-Collecting Steiner Forest
por: Ahmadi, Ali, et al.
Publicado: (2023)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2026)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
por: Makarychev, Yury, et al.
Publicado: (2024)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
por: Mahapatra, Sugyani, et al.
Publicado: (2021)

The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
por: Paschmanns, Paul, et al.
Publicado: (2026)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
por: Disser, Yann, et al.
Publicado: (2024)

Structural Parameters for Steiner Orientation
por: Hanaka, Tesshu, et al.
Publicado: (2025)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
por: Groenland, Carla, et al.
Publicado: (2024)