Usage
  • 10 views
  • 4 downloads

Tight Analysis of Local Search Heuristics for the Red-Blue Median Problem

  • Author / Creator
    Zhang, Yifeng
  • Budgeted Red-Blue Median is a generalization of classic k-Median in that there are two sets of facilities, say R and B, that can be used to serve clients located in some metric space. The goal is to open kr facilities in R and kb facilities in B for some given bounds kr,kb and connect each client to their nearest open facility in a way that minimizes the total connection cost.

  • Subjects / Keywords
  • Graduation date
    2017-06:Spring 2017
  • Type of Item
    Thesis
  • Degree
    Master of Science
  • DOI
    https://doi.org/10.7939/R39W09B38
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
    English
  • Institution
    University of Alberta
  • Degree level
    Master's
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Friggstad, Zachary (Computing Science)
  • Examining committee members and their departments
    • Friggstad, Zachary (Computing Science)
    • Lin, Guohui (Computing Science)
    • Salavatipour, Mohammad R (Computing Science)