Pages that link to "Item:Q1884770"

The following pages link to Primal-dual algorithms for connected facility location problems (Q1884770):

Displaying 40 items.

• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
• Benders decomposition of the passive optical network design problem (Q325394) (← links)
• Deterministic sampling algorithms for network design (Q547282) (← links)
• Dynamic vs. oblivious routing in network design (Q634684) (← links)
• An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
• Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
• LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← 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)
• Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
• Approximation algorithms for connected facility location problems (Q1016041) (← links)
• Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
• Computing a tree having a small vertex cover (Q2272400) (← links)
• Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
• A PTAS for the geometric connected facility location problem (Q2408564) (← links)
• Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
• A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439) (← links)
• Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
• Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
• A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
• Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← 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)
• Connected Fair Domination in Graphs (Q5114990) (← links)
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
• (Q5743446) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)