Tight Analysis of Local Search Heuristics for the Red-Blue Median Problem
Loading...
Date
Author
Institution
http://id.loc.gov/authorities/names/n79058482
Degree Level
Master's
Degree
Master of Science
Department
Department of Computing Science
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
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.
Item Type
http://purl.org/coar/resource_type/c_46ec
Alternative
License
Other License Text / Link
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.
Subject/Keywords
Language
en