Improved approximation algorithms for directed Steiner forest
From MaRDI portal
Recommendations
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 2119644 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A Parallel Repetition Theorem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A deterministic algorithm for the cost-distance problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A greedy approximation algorithm for the group Steiner problem
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A simple efficient approximation scheme for the restricted shortest path problem
- An improved LP-based approximation for Steiner tree
- An improved approximation scheme for the Group Steiner Problem
- Approximating Steiner networks with node-weights
- Approximating directed buy-at-bulk network design
- Approximating the weight of shallow Steiner trees
- Approximation Algorithms for Directed Steiner Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximation algorithms for nonuniform buy-at-bulk network design
- Cost-Distance: Two Metric Network Design
- Design networks with bounded pairwise distance
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Handbook of Approximation Algorithms and Metaheuristics
- Randomized metarounding
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- The dense \(k\)-subgraph problem
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
- Tight approximation algorithm for connectivity augmentation problems
- Tighter Bounds for Graph Steiner Tree Approximation
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(22)- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- How to Secure Matchings against Edge Failures
- On minimum generalized Manhattan connections
- Spider covering algorithms for network design problems
- An ETH-tight algorithm for bidirected Steiner connectivity
- The complexity of contracts
- Parameterized approximation algorithms for bidirected Steiner network problems
- ETH-hardness of approximating 2-CSPs and directed Steiner network
- Stronger MIP formulations for the Steiner forest problem
- Approximating the generalized minimum Manhattan network problem
- Online Buy-at-Bulk Network Design
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
- Approximating node-connectivity augmentation problems
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- The parameterized complexity of the survivable network design problem
- Improved approximation for the directed spanner problem
- Solving zero-sum games using best-response oracles with applications to search games
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms
- Improved approximating algorithms for directed Steiner forest
This page was built for publication: Improved approximation algorithms for directed Steiner forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414883)
