Improved algorithms to network \(p\)-center location problems

DOI10.1016/J.COMGEO.2009.07.003zbMath1281.65028OpenAlexW1968580189MaRDI QIDQ390143

Qiaosheng Shi, Binay K. Bhattacharya

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.07.003

zbMATH Keywords

algorithmtree decompositioncenter location problemKlee's measure problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ The weighted \(k\)-center problem in trees for fixed \(k\)

This page was built for publication: Improved algorithms to network \(p\)-center location problems