Pages that link to "Item:Q1959419"

The following pages link to Connected facility location via random facility sampling and core detouring (Q1959419):

Displaying 18 items.

• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
• LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
• The A priori traveling repairman problem (Q722527) (← links)
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
• Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• Computing a tree having a small vertex cover (Q2272400) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
• APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
• LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
• Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
• Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)