Pages that link to "Item:Q1123630"

The following pages link to The Steiner problem with edge lengths 1 and 2 (Q1123630):

Displaying 43 items.

• 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)
• Watchman routes for lines and line segments (Q2445196) (← links)
• Algorithms for terminal Steiner trees (Q2465633) (← links)
• A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
• Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
• Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
• Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
• Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
• Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← 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)
• Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
• Approximating Alternative Solutions (Q3511329) (← links)
• Reoptimization of Steiner Trees (Q3512464) (← links)
• Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
• The steiner problem in the hypercube (Q3989541) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• The Bursty Steiner Tree Problem (Q4639923) (← links)
• Multi-level Steiner Trees (Q4984869) (← links)
• RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
• On the approximability of the maximum common subgraph problem (Q5096796) (← links)
• Multi-Level Steiner Trees. (Q5140725) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• On the Hardness of Reoptimization (Q5448637) (← links)
• Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
• (Q5743426) (← links)
• On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
• Travelling on graphs with small highway dimension (Q5925522) (← 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)
• The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
• Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)