• DOI:10.4230/LIPIcs.ICALP.2016.75
Corpus ID: 9313875

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

@inproceedings{Friggstad2016TightAO,
  title={Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median},
  author={Zachary Friggstad and Yifeng Zhang},
  booktitle={ICALP},
  year={2016}
}

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed