Pages that link to "Item:Q4240134"

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

Displaying 45 items.

• Integrating facility location and production planning decisions (Q3057133) (← links)
• A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION (Q3173932) (← links)
• An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
• A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
• Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
• A General k-Level Uncapacitated Facility Location Problem (Q3602009) (← links)
• The facility location problem with general cost functions (Q4422623) (← links)
• Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
• A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties (Q4981876) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
• (Q5002778) (← links)
• (Q5002844) (← links)
• Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
• (Q5009599) (← links)
• (Q5075771) (← links)
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
• (Q5091192) (← links)
• Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
• (Q5214247) (← links)
• Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
• A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
• On Min-Max r-Gatherings (Q5443378) (← links)
• Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
• (Q5743432) (← links)
• Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
• On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• A local search approximation algorithm for a squared metric \(k\)-facility location problem (Q5916060) (← links)
• Mixed fault tolerance in server assignment: combining reinforcement and backup (Q5918902) (← links)
• Approximation algorithms for hierarchical location problems (Q5920573) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• Robust network function virtualization (Q6066069) (← links)
• Problem-driven scenario clustering in stochastic optimization (Q6088772) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• The facility location problem with maximum distance constraint (Q6121428) (← links)
• New algorithms for fair \(k\)-center problem with outliers and capacity constraints (Q6128707) (← links)
• A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
• \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
• A cost-sharing scheme for the \(k\)-product facility location game with penalties (Q6591647) (← links)
• Improved lower bound for differentially private facility location (Q6602319) (← links)
• An approximate cost recovery scheme for the \(k\)-product facility location game with penalties (Q6639743) (← links)