Pages that link to "Item:Q952442"
From MaRDI portal
The following pages link to The Steiner tree problem on graphs: inapproximability results (Q952442):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← 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)
- The complexity of flow expansion and electrical flow expansion (Q831846) (← links)
- Comments on Bern's probabilistic results on rectilinear Steiner trees (Q911764) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- The internal Steiner tree problem: Hardness and approximations (Q1931427) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← 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)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- (Q3731620) (← links)
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete (Q4446892) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- (Q4840101) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5009490) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- (Q5874465) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
