Article thumbnail

Connected facility leasing problems

By MS De Lima (8489970), MĆS Felice (8489973) and O Lee (8489967)

Abstract

We study leasing variants of the connected facility location problem, in which we wish to connect a set of clients to facilities, and facilities are connected via core edges, whose cost is a scale factor times the cost of a simple edge. We identify two aspects of the problem that can lead to different variants: (a) if there is a single or multiple commodities, and (b) if we lease facilities and buy core edges, or if we lease both facilities and core edges. Combining these aspects, we propose four variants of the problem, and we give approximation and competitive online algorithms for each of them when the (smallest) scale factor is 1. The algorithms we propose follow the technique of combining available algorithms for the underlying facility leasing and Steiner problems

Topics: Uncategorized, Uncategorised value, leasing optimization, connected facility location, multi-commodity, approximation algorithms, competitive online algorithms
Year: 2017
OAI identifier: oai:figshare.com:article/11897490
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2381/118... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.