Pages that link to "Item:Q5903542"
From MaRDI portal
The following pages link to A faster approximation algorithm for the Steiner problem in graphs (Q5903542):
Displaying 7 items.
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Balancing graph Voronoi diagrams with one more vertex (Q6196878) (← links)
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles (Q6567758) (← links)
- High-fugacity expansion and crystallization in non-sliding hard-core lattice particle models without a tiling constraint (Q6635287) (← links)