Pages that link to "Item:Q1383806"
From MaRDI portal
The following pages link to New approximation algorithms for the Steiner tree problems (Q1383806):
Displayed 17 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
- An approximation for minimum multicast route in optical networks with nonsplitting nodes (Q2583176) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)