Abstract
A mind-boggling amount of data will be generated every day. It is natural to consider clustering the data and putting each cluster into some place for storing. In reality, the arrival time of the data is unknown in advance and new data keep joining appropriate cluster upon arrival. This scenario can be captured as the online facility location problem. Usually, the places for storing the data have limited capacities. Therefore, the online capacitated facility location problem (O-CFLP) is proposed.Designing algorithms with bounded competitive ratios for the O-CFLP is impossible. This fact stimulates us to study special cases of the O-CFLP. We pay attention on the online soft capacitated facility location problem and its prize-collecting version, and we design dual-fitting competitive algorithms for them.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
