k-Center problems with minimum coverage

Authors:
Andrew Lim;Brian Rodrigues;Fan Wang;Zhou Xu
Affiliations:
Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;School of Business, Singapore Management University, Singapore;Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Theoretical Computer Science
Year:
2005

Citing 8
Cited 9

A unified approach to approximation algorithms for bottleneck problems

Journal of the ACM (JACM)
A heuristic for the p-center problem in graphs

Discrete Applied Mathematics
How to allocate network centers

Journal of Algorithms
On a generalization of the p-Center Problem

Information Processing Letters
The p-neighbor k-center problem

Information Processing Letters
Fault tolerant K-center problems

Theoretical Computer Science
The Capacitated K-Center Problem

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Asymmetric k-center with minimum coverage

Information Processing Letters
Performance evaluation for different settings of crossover and mutation rates considering number of covered users: a case study

Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
A study on the performance of local search versus population-based methods for mesh router nodes placement problem

Journal of Intelligent Manufacturing
The Farthest Spatial Skyline Queries

Information Systems
Performance Evaluation of WMN-GA Simulation System for Different Settings of Genetic Operators Considering Giant Component and Number of Covered Users

International Journal of Distributed Systems and Technologies
Dynamic router node placement in wireless mesh networks: A PSO approach with constriction coefficient and its convergence analysis

Information Sciences: an International Journal
Effects of population size for location-aware node placement in WMNs: evaluation by a genetic algorithm--based approach

Personal and Ubiquitous Computing
Performance evaluation of WMN-GA for different mutation and crossover rates considering number of covered users parameter

Mobile Information Systems
A comparison study of simulated annealing and genetic algorithm for node placement problem in wireless mesh networks

Journal of Mobile Multimedia

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centers while allowing each center to cater to a spread of clients. We study three variants of this problem, all of which are shown to be N P-hard. In-approximation hardness and approximation algorithms with factors equal or close to the best lower bounds are provided. Generalizations, including vertex costs and vertex weights, are also studied.