Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median

  title={Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median},
  author={Zachary Friggstad and Yifeng Zhang},
  • Zachary Friggstad, Yifeng Zhang
  • Published in ICALP 2016
  • Mathematics, Computer Science
  • Budgeted Red-Blue Median is a generalization of classic $k$-Median in that there are two sets of facilities, say $\mathcal{R}$ and $\mathcal{B}$, that can be used to serve clients located in some metric space. The goal is to open $k_r$ facilities in $\mathcal{R}$ and $k_b$ facilities in $\mathcal{B}$ for some given bounds $k_r, k_b$ and connect each client to their nearest open facility in a way that minimizes the total connection cost. We extend work by Hajiaghayi, Khandekar, and Kortsarz… CONTINUE READING
    8 Citations
    A Fast Approximation Scheme for Low-Dimensional k-Means
    • 15
    • PDF
    One Size Fits All : Effectiveness of Local Search on Structured Data
    • 3
    • PDF
    On the Local Structure of Stable Clustering Instances
    • 26
    • PDF
    Local Search Approximation Algorithms for the Spherical k-Means Problem
    • 2
    Large-scale optimization for data placement problem
    Approximation algorithms for spherical k-means problem using local search scheme
    • 1


    Simpler Analyses of Local Search Algorithms for Facility Location
    • 71
    • PDF
    Local Search Algorithms for the Red-Blue Median Problem
    • 19
    • Highly Influential
    Improved Combinatorial Algorithms for Facility Location Problems
    • 180
    • PDF
    Local Search Heuristics for k-Median and Facility Location Problems
    • 585
    • PDF
    Facility location with nonuniform hard capacities
    • 135
    • PDF
    Local search heuristics for the mobile facility location problem
    • 19
    • PDF
    A 3-Approximation for Facility Location with Uniform Capacities
    • 28
    Universal Facility Location
    • 110