Pages that link to "Item:Q5395705"
From MaRDI portal
The following pages link to Steiner Tree Approximation via Iterative Randomized Rounding (Q5395705):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Two-level hub Steiner trees (Q2059893) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5002685) (← links)
- (Q5002844) (← links)
- (Q5009490) (← links)
- (Q5075788) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- (Q5092379) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Exploring the Tractability of the Capped Hose Model (Q5111705) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- (Q5136215) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- (Q5874465) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
