k-center problems with minimum coverage

DOI10.1016/J.TCS.2004.08.010MaRDI QIDQ1770377zbMATH OpenOpenAlexFDO

Authors Brian Rodrigues, F. Wang, Zhou Xu, Andrew 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

\(k\)-center problemApproximation algorithmMinimum coverage

Mathematics Subject Classification ID

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

Recommendations

• Asymmetric \(k\)-center with minimum coverage
• The Capacitated K-Center Problem
• Fault tolerant \(K\)-center problems
• Capacitated k-center problem with vertex weights
• The capacitated K-center problem (extended abstract)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A heuristic for the p-center problem in graphs
• A simple heuristic for the p-centre problem
• Easy and hard bottleneck location problems
• Fault tolerant \(K\)-center problems
• How to Allocate Network Centers
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The p-neighbor k-center problem
• The Capacitated K-Center Problem

Cited in

(16)

• k-balanced center location problem: a new multi-objective facility location problem
• On the k-center problem with many centers
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• A technique for obtaining true approximations for \(k\)-center with covering constraints
• Solving \(k\)-center problems involving sets based on optimization techniques
• Asymmetric \(k\)-center with minimum coverage
• The minimal k-core problem for modeling k-assemblies
• Insertion heuristics for central cycle problems
• scientific article; zbMATH DE number 177560 (Why is no real title available?)
• The freight allocation problem with lane cost balancing constraint
• Computing and Combinatorics
• 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
• Fair colorful k-center clustering
• Covering clients with types and budgets
• Constrained \(k\)-center and movement to independence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770377)