Pages that link to "Item:Q5317176"

The following pages link to Improved Combinatorial Algorithms for Facility Location Problems (Q5317176):

Displaying 50 items.

• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Contention-aware data caching in wireless multi-hop ad hoc networks (Q635358) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
• An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
• Approximation algorithm for facility location with service installation costs (Q924885) (← links)
• Kinetic facility location (Q970606) (← links)
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
• Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
• Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
• Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
• Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Clustering with or without the approximation (Q2377383) (← links)
• Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
• An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
• Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← links)
• Study and development of the DTD generation system for XML documents (Q2432981) (← links)
• Cache placement in sensor networks under an update cost constraint (Q2466007) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
• Approximating $k$-Median via Pseudo-Approximation (Q2805513) (← links)
• Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
• Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems (Q2971170) (← links)
• Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
• Integrating facility location and production planning decisions (Q3057133) (← links)
• A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION (Q3173932) (← links)
• Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
• Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
• The Priority k-Median Problem (Q5458823) (← links)
• (Q5743432) (← links)
• (Q5743439) (← links)