Asymmetric k-center with minimum coverage

DOI10.1016/J.IPL.2007.08.006MaRDI QIDQ2380063zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Inge Li Gørtz

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.08.006

zbMATH Keywords

asymmetryclusteringapproximation algorithmsdesign of algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• \(k\)-center problems with minimum coverage
• Asymmetry in \(k\)-center variants
• Asymmetry in \(k\)-center variants
• Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
• Asymmetric k -center is log ^* n -hard to approximate

Cites work

• scientific article; zbMATH DE number 1757943 (Why is no real title available?)
• scientific article; zbMATH DE number 871893 (Why is no real title available?)
• A Best Possible Heuristic for the k-Center Problem
• A heuristic for the p-center problem in graphs
• Algorithms for facility location problems with outliers. (Extended abstract)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
• Asymmetry in \(k\)-center variants
• Easy and hard bottleneck location problems
• Facility location with dynamic distance functions
• The p-neighbor k-center problem
• \(k\)-center problems with minimum coverage

Cited in

(6)

• Computing and Combinatorics
• Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
• \(k\)-center problems with minimum coverage
• The connected p-center problem on block graphs with forbidden vertices
• Asymmetric k -center is log ^* n -hard to approximate
• Asymmetry in \(k\)-center variants

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

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