Pages that link to "Item:Q4500859"

The following pages link to A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 (Q4500859):

Displaying 29 items.

• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
• A partition-based relaxation for Steiner trees (Q535014) (← links)
• Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
• A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
• Wireless network design via 3-decompositions (Q990943) (← links)
• Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
• On the approximability of the Steiner tree problem. (Q1401253) (← links)
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
• Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
• A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
• Weighted matching with pair restrictions (Q1749789) (← links)
• Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
• Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
• Energy-efficient communication in multi-interface wireless networks (Q1946498) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
• The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
• Optimal relay location for resource-limited energy-efficient wireless communication (Q2433926) (← links)
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
• Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• Energy-Efficient Communication in Multi-interface Wireless Networks (Q3182916) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• (Q5136215) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)