A simple greedy approximation algorithm for the minimum connected \(k\)-center problem

DOI10.1007/s10878-015-9831-8zbMath1347.90073OpenAlexW2028082337MaRDI QIDQ281773

Liquan Mei, Dongyue Liang, Wei Wang, James Willson

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9831-8

zbMATH Keywords

approximation algorithmgreedy algorithm\(k\)-center

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• Fault tolerant \(K\)-center problems
• The Design of Approximation Algorithms
• Asymmetric k -center is log ^* n -hard to approximate
• A Best Possible Heuristic for the k-Center Problem
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• The Capacitated K-Center Problem

This page was built for publication: A simple greedy approximation algorithm for the minimum connected \(k\)-center problem