Steiner tree approximation via iterative randomized rounding
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A robust and scalable algorithm for the Steiner problem in graphs
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Approximating Steiner trees and forests with minimum number of Steiner points
- Two-level hub Steiner trees
- Approximation algorithms for connectivity augmentation problems
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Approximating activation edge-cover and facility location problems
- Robust reoptimization of Steiner trees
- Bayesian generalized network design
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Stronger MIP formulations for the Steiner forest problem
- An improved algorithm for the Steiner tree problem with bounded edge-length
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- A 3/2-approximation algorithm for some minimum-cost graph problems
- On full Steiner trees in unit disk graphs
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Chvátal-Gomory cuts for the Steiner tree problem
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Approximation algorithms for priority Steiner tree problems
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Combination algorithms for Steiner tree variants
- An improved LP-based approximation for Steiner tree
- A practical greedy approximation for the directed Steiner tree problem
- On the price of stability of undirected multicast games
- Local search based approximation algorithms for two-stage stochastic location problems
- Analysis of Steiner subtrees of random trees for traceroute algorithms
- Improved algorithms for joint optimization of facility locations and network connections
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- Approximating Steiner trees and forests with minimum number of Steiner points
- Steiner trees with bounded RC-delay
- A practical greedy approximation for the directed Steiner tree problem
- The influence of preprocessing on Steiner tree approximations
- Prize-collecting Steiner networks via iterative rounding
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- Strong Steiner tree approximations in practice
- The bursty Steiner tree problem
- Spider covering algorithms for network design problems
- Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Multi-level Steiner trees
- Efficient black-box reductions for separable cost sharing
- On the integrality gap of the prize-collecting Steiner forest LP
- New algorithms for Steiner tree reoptimization
- Efficient black-box reductions for separable cost sharing
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Improved approximation algorithms for inventory problems
- Bayesian generalized network design
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Approximating activation edge-cover and facility location problems
- A Spectral Approach to Network Design
- Lossy Kernels for Hitting Subgraphs
- Exploring the tractability of the capped hose model
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Weighted linear matroid parity
- Multi-Level Steiner Trees.
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- A weighted linear matroid parity algorithm
- Steiner trees with bounded RC-delay
- A partition-based relaxation for Steiner trees
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- scientific article; zbMATH DE number 7651143 (Why is no real title available?)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- Implications, conflicts, and reductions for Steiner trees
- Improved approximation algorithms for minimum power covering problems
- Implications, conflicts, and reductions for Steiner trees
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
- Node connectivity augmentation via iterative randomized rounding
- On the lossy kernelization for connected treedepth deletion set
- On the complexity of the cable-trench problem
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Stronger path‐based extended formulation for the Steiner tree problem
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals
- Universal Algorithms for Clustering Problems
- Solving Steiner trees: Recent advances, challenges, and perspectives
- The Clustered Selected-Internal Steiner Tree Problem
- An ETH-tight algorithm for bidirected Steiner connectivity
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Multi-priority graph sparsification
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- A (1/2+1/60)-approximation algorithm for maximum weight series-parallel subgraph
This page was built for publication: Steiner tree approximation via iterative randomized rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395705)
