Pages that link to "Item:Q4240134"

The following pages link to Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134):

Displaying 50 items.

• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Clustering through continuous facility location problems (Q346248) (← links)
• An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
• Data stability in clustering: a closer look (Q465252) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
• Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Incremental facility location problem and its competitive algorithms (Q604759) (← links)
• An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
• An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
• On min-max \(r\)-gatherings (Q627109) (← links)
• A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
• Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
• An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
• Beyond Moulin mechanisms (Q834858) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
• Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• Approximation algorithm for facility location with service installation costs (Q924885) (← links)
• Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
• Non-cooperative facility location and covering games (Q964406) (← links)
• A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
• Kinetic facility location (Q970606) (← links)
• Randomized priority algorithms (Q974749) (← links)
• Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
• An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272) (← links)
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
• An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities (Q1690580) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
• Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
• Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
• Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
• The General Steiner Tree-Star problem. (Q1853139) (← links)
• Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
• An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
• On the power of static assignment policies for robust facility location problems (Q2061885) (← links)