Online k-color spanning disk problems

Yin Wang, Yinfeng Xu, Huili Zhang () and Weitian Tong
Additional contact information
Yin Wang: Xi’an Jiaotong University
Yinfeng Xu: Xi’an Jiaotong University
Huili Zhang: Xi’an Jiaotong University
Weitian Tong: Georgia Southern University

Journal of Combinatorial Optimization, 2023, vol. 46, issue 2, No 6, 14 pages

Abstract: Abstract 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$$ m ≤ 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 1 , C 2 , … , C T ⟩ , $$C_t\subseteq C$$ C t ⊆ C , $$|C_t| \ge k$$ | C t | ≥ k , $$t\in \{1, 2, \ldots , T\}$$ t ∈ { 1 , 2 , … , 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)$$ O ( n m 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.

Keywords: Minimum color spanning disk; Voronoi diagram; Online algorithm; Competitive ratio (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01080-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:46:y:2023:i:2:d:10.1007_s10878-023-01080-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01080-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().