TY - GEN
T1 - A Survey on Capacitated Covering and Related Problems
AU - Kao, Mong Jen
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/2
Y1 - 2020/2
N2 - The Capacitated Covering Problem is a natural generalization of classical covering problems that takes quantified demand-to-supply assignment model into consideration. In recent years, this problem has received more and more attention, and a rich body of research progress has been made not only on this problem itself but also on its natural extensions and variations. In this paper we present a literature survey on the capacitated covering problem and the research progress that has been made.
AB - The Capacitated Covering Problem is a natural generalization of classical covering problems that takes quantified demand-to-supply assignment model into consideration. In recent years, this problem has received more and more attention, and a rich body of research progress has been made not only on this problem itself but also on its natural extensions and variations. In this paper we present a literature survey on the capacitated covering problem and the research progress that has been made.
KW - approximation algorithms
KW - capacitated covering
UR - http://www.scopus.com/inward/record.url?scp=85092152326&partnerID=8YFLogxK
U2 - 10.1109/Indo-TaiwanICAN48429.2020.9181321
DO - 10.1109/Indo-TaiwanICAN48429.2020.9181321
M3 - Conference contribution
AN - SCOPUS:85092152326
T3 - Indo - Taiwan 2nd International Conference on Computing, Analytics and Networks, Indo-Taiwan ICAN 2020 - Proceedings
SP - 266
EP - 272
BT - Indo - Taiwan 2nd International Conference on Computing, Analytics and Networks, Indo-Taiwan ICAN 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - Indo - Taiwan 2nd International Conference on Computing, Analytics and Networks, Indo-Taiwan ICAN 2020
Y2 - 7 February 2020 through 15 February 2020
ER -