Online k-color spanning disk problems
Tóm tắt
Inspired by the applications in on-demand manufacturing, we introduce the online k-color spanning disk problem, the first online model for color spanning problems to the best of our knowledge. Given a set P of n colored points in a plane, with each color chosen from a set C of
$$m \le n$$
colors, the online k-color spanning disk problem determines the location of the center that minimizes the accumulated radius of the minimum spanning disks for a sequence of color sets, denoted by
$$\delta =\langle C_1,C_2,\ldots ,C_T\rangle $$
,
$$C_t\subseteq C$$
,
$$|C_t| \ge k$$
,
$$t\in \{1, 2, \ldots , T\}$$
, as they are presented online. Here, a minimum spanning disk for a color set means a disk contains at least one point of each color. We construct a special instance to establish a lower bound on the performance of any online algorithms. Then, an
$$O(nm\log n)$$
-time Voronoi-diagram-based algorithm is designed such that its competitive ratio matches the problem’s lower bound. This implies our algorithm is theoretically the best possible in terms of the competitive ratio. We also introduce and study a variant, named the online balanced k-color spanning disk problem, for which a non-trivial lower bound and a best possible algorithm are presented.
Tài liệu tham khảo
Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma Lihong, Palop B, Sacristán V (2001) Smallest color-spanning objects. In: European symposium on algorithms, pages 278–289
Bereg Sergey, Ma Feifei, Wang Wencheng, Zhang Jian, Zhu Binhai (2019) On some matching problems under the color-spanning model. Theoret Comput Sci 786:26–31
Das Sandip, Goswami Partha P, Nandy Subhas C (2009) Smallest color-spanning object revisited. Int J Comput Geometry Appl 19(05):457–478
Fleischer R, Xu X (2010) Computing minimum diameter color-spanning sets. In: international workshop on frontiers in algorithmics, pages 285–292
Fleischer Rudolf, Xiaoming Xu (2011) Computing minimum diameter color-spanning sets is hard. Inf Process Lett 111(21–22):1054–1056
Fortune S (1986) A sweepline algorithm for voronoi diagrams. In: Proceedings of the second annual symposium on computational geometry, pages 313–322
Wenqi Ju, Fan Chenglin, Luo Jun, Zhu Binhai, Daescu Ovidiu (2013) On some geometric problems of color-spanning sets. J Comb Optim 26(2):266–283
Kazemi Mohammad Reza, Mohades Ali, Khanteimouri Payam (2018) Approximation algorithms for color spanning diameter. Inf Process Lett 135:53–56
Khanteimouri P, Mohades A, Abam Mohammad A, Kazemi Mohammad R(2013) Computing the smallest color-spanning axis-parallel square. In: International symposium on algorithms and computation, pages 634–643
Kirkpatrick David (1983) Optimal search in planar subdivisions. SIAM J Comput 12(1):28–35
Li Chao, Fan Chenglin, Luo Jun, Zhong Farong, Zhu Binhai (2015) Expected computations on color spanning sets. J Comb Optim 29(3):589–604
Mantas I, Papadopoulou E, Sacristán V, Silveira Rodrigo I (2021) Farthest color voronoi diagrams: complexity and algorithms. In: Latin American symposium on theoretical informatics, pages 283–295
Pruente Jonas (2019) Minimum diameter color-spanning sets revisited. Discret Optim 34:100550
Zhang D, Chee Yeow M, Mondal A, Tung Anthony KH, Kitsuregawa M(2009) Keyword search in spatial databases: Towards searching by document. In: IEEE 25th international conference on data engineering, pages 688–699