Pages that link to "Item:Q5903542"

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

Displaying 48 items.

• On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
• Approximating the tree and tour covers of a graph (Q688437) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
• An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
• A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
• Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
• The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
• A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← 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)
• Class Steiner trees and VLSI-design (Q1276969) (← links)
• An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
• Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
• Tree polytope on 2-trees (Q1322553) (← links)
• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
• Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
• The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Efficient and effective community search (Q1715901) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062) (← links)
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
• Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
• An 11/6-approximation algorithm for the network Steiner problem (Q2366230) (← links)
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100) (← links)
• Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks (Q3223935) (← links)
• Boosting the Exploration of Huge Dynamic Graphs (Q3297380) (← links)
• A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs (Q3438968) (← links)
• The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
• (Q4520239) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← links)
• On small world non-Sunada twins and cellular Voronoi diagrams (Q5158939) (← links)
• A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
• Proximity graphs inside large weighted graphs (Q5326777) (← links)
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
• 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)