Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Computing largest minimum color-spanning intervals of imprecise points
A Acharyya, V Keikha, M Saumell… - Latin American Symposium …, 2024 - Springer
We study a geometric facility location problem under imprecision. Given n unit intervals in
the real line, each with one of k colors, the goal is to place one point in each interval such …
the real line, each with one of k colors, the goal is to place one point in each interval such …
Maximum-width rainbow-bisecting empty annulus
SW Bae, S Banerjee, A Baral, PRS Mahapatra… - Computational …, 2024 - Elsevier
Given a set of n colored points with k colors in the plane, we study the problem of computing
a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-parallel …
a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-parallel …
The 2-Mixed-Center Color Spanning Problem
Y Wang, Y Xu, Y Xu, H Zhang - International Conference on Combinatorial …, 2023 - Springer
Inspired by the applications in cloud manufacturing, we introduce a new 2-mixed-center
version of the minimum color spanning problem, the first mixed-center model for color …
version of the minimum color spanning problem, the first mixed-center model for color …
An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint
Y Wang, Y Xu - … Systems. Artificial Intelligence for Sustainable and …, 2021 - Springer
Motivated by the need for a more sensitive server assignment strategy in supply-chain
network management, our total cost comprises coverage area (ie, disk) sizes and “moving” …
network management, our total cost comprises coverage area (ie, disk) sizes and “moving” …