Pages that link to "Item:Q2366230"
From MaRDI portal
The following pages link to An 11/6-approximation algorithm for the network Steiner problem (Q2366230):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← 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)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- A simple proof of the planar rectilinear Steiner ratio (Q1200801) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- New Reoptimization Techniques applied to Steiner Tree Problem (Q2840741) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- DIAMETER-CONSTRAINED STEINER TREES (Q2905280) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs (Q3438968) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
