scientific article; zbMATH DE number 1305468
From MaRDI portal
Publication:4252355
Recommendations
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- Approximation of Steiner forest via the bidirected cut relaxation
- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- On a bidirected relaxation for the MULTIWAY CUT problem
- Parameterized approximation algorithms for bidirected Steiner network problems
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- A partition-based relaxation for Steiner trees
- The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)
Cited in
(25)- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic
- Recent results on approximating the Steiner tree problem and its generalizations
- On approximability of the independent/connected edge dominating set problems
- On imposing connectivity constraints in integer programs
- Steiner trees in uniformly quasi-bipartite graphs.
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Approximation of Steiner forest via the bidirected cut relaxation
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Combination algorithms for Steiner tree variants
- On the price of stability of undirected multicast games
- Approximation algorithms for metric tree cover and generalized tour and tree covers
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
- Approaches to the Steiner Problem in Networks
- A partition-based relaxation for Steiner trees
- Some results on spanning trees
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- 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
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- An improved approximation guarantee for prize-collecting TSP
- The complexity landscape of fixed-parameter directed Steiner network problems
- Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs
- New primal-dual algorithms for Steiner tree problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252355)
