1 paper
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The weighted k-center problem in graphs is a classical facility location problem where we place k centers on the graph, which minimize the maximum weighted distance of a vertex…