Pages that link to "Item:Q4314498"
From MaRDI portal
The following pages link to Improved Approximations for the Steiner Tree Problem (Q4314498):
Displaying 37 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← 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)
- 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)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← 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)
- 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)
- 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)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← 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)
- 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)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← 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)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- (Q5708491) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)