A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
Chromatic k-median is a frequently encountered problem in the determination of the topological structures of chromosomes. This problem considers a set C of colored clients and a set F of facilities located in a metric space, where |C U F| = n. The goal is to open k facilities and assign each client...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9358230/ |