Pages that link to "Item:Q1123630"
From MaRDI portal
The following pages link to The Steiner problem with edge lengths 1 and 2 (Q1123630):
Displaying 50 items.
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Wildlife corridors as a connected subgraph problem (Q456412) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- The full Steiner tree problem (Q702772) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- A hard dial-a-ride problem that is easy on average (Q880497) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← 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)
- Methods for reconstructing the history of tandem repeats and their application to the human genome. (Q1872719) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- On full Steiner trees in unit disk graphs (Q2349739) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
