Pages that link to "Item:Q5903117"

The following pages link to A faster approximation algorithm for the Steiner problem in graphs (Q5903117):

Displaying 13 items.

• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
• Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
• Branch-and-bound as a higher-order function (Q1179748) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• Path-distance heuristic for the Steiner problem in undirected networks (Q1186805) (← links)
• Heuristics for the Steiner problem in graphs (Q1199447) (← links)
• Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
• The Steiner problem in distributed computing systems (Q1310949) (← links)
• The algorithmic structure of a decision support system for a design of a district heating network (Q1825117) (← links)
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
• A faster approximation algorithm for the Steiner problem in graphs (Q5903542) (← links)