Pages that link to "Item:Q4314498"
From MaRDI portal
The following pages link to Improved Approximations for the Steiner Tree Problem (Q4314498):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- A degree based approach to find Steiner trees (Q327685) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← 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)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- On efficient implementation of an approximation algorithm for the Steiner tree problem (Q911286) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816) (← links)
- New approximation algorithms for the Steiner tree problems (Q1383806) (← 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)
- Improved upper bounds for the Steiner ratio (Q1662104) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- Cache placement in sensor networks under an update cost constraint (Q2466007) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Steiner points in tree metrics don't (really) help (Q2768295) (← links)
- (Q3002765) (← links)
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph (Q3104595) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- An approximation scheme for some Steiner tree problems in the plane (Q4344454) (← links)
- Improved Approximation Algorithm for Steiner <i>k</i> -Forest with Nearly Uniform Weights (Q4554929) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Graph-based Retrieval for Claim Verification over Cross-document Evidence (Q5050361) (← links)
