Pages that link to "Item:Q5317602"
From MaRDI portal
The following pages link to Tighter Bounds for Graph Steiner Tree Approximation (Q5317602):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks (Q443720) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree (Q666113) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← 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)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Algorithms for terminal Steiner trees (Q2465633) (← links)
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS (Q2905310) (← links)
- On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
- On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric (Q3010411) (← links)
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 (Q3183443) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- (Q5009490) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- (Q5092379) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- (Q5874465) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
