Pages that link to "Item:Q1209349"

The following pages link to Approximation algorithms for geometric median problems (Q1209349):

Displaying 31 items.

• Local search algorithms for the red-blue median problem (Q692631) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
• K-center and K-median problems in graded distances (Q1274996) (← links)
• An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
• An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
• Cluster editing problem for points on the real line: a polynomial time algorithm (Q1675767) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
• Approximation algorithms for median hub location problems (Q2424817) (← links)
• Cache placement in sensor networks under an update cost constraint (Q2466007) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• An approximate median search algorithm in non-metric spaces (Q2748190) (← links)
• Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
• An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
• An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
• Approximation schemes for Euclidean \(k\)-medians and related problems (Q4542527) (← links)
• (Q4943526) (← 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)
• Experimental and Efficient Algorithms (Q5710025) (← links)
• (Q5743493) (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)