\(k\)-center problems with minimum coverage

DOI10.1016/j.tcs.2004.08.010zbMath1070.68155OpenAlexW2037981733MaRDI QIDQ1770377

Zhou Xu, Brian Rodrigues, Fan Wang, Andrew E. B. Lim

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.010

zbMATH Keywords

Approximation algorithm\(k\)-center problemMinimum coverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (6)

Asymmetric \(k\)-center with minimum coverage ⋮ The freight allocation problem with lane cost balancing constraint ⋮ Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm ⋮ Node placement for wireless mesh networks: analysis of WMN-GA system simulation results for different parameters and distributions ⋮ Insertion heuristics for central cycle problems ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

Cites Work

• Unnamed Item
• The \(p\)-neighbor \(k\)-center problem
• A simple heuristic for the p-centre problem
• A heuristic for the p-center problem in graphs
• Easy and hard bottleneck location problems
• Fault tolerant \(K\)-center problems
• A Best Possible Heuristic for the k-Center Problem
• How to Allocate Network Centers
• The Capacitated K-Center Problem

This page was built for publication: \(k\)-center problems with minimum coverage