A Polynomial Time Approximation Scheme for the Closest Shared Center Problem

DOI10.1007/978-3-642-38768-5_35MaRDI QIDQ4925254zbMATH OpenOpenAlexFDO

Authors Weidong Li, Lusheng Wang, Wenjuan Cui

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38768-5_35

Mathematics Subject Classification ID

Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10)

Recommendations

• A polynomial time approximation scheme for the closest shared center problem
• The parameterized complexity of the shared center problem
• The parameterized complexity of the shared center problem
• An approximation algorithm for k-center problem on a convex polygon
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
• Generalized p-center problems: Complexity results and approximation algorithms
• scientific article; zbMATH DE number 4141774
• An optimal approximation algorithm for the rectilinear m-center problem
• Approximation algorithms for the k-center problem: an experimental evaluation
• Polynomial algorithms for restricted Euclidean p-centre problems

Cited in

(1)

• A polynomial time approximation scheme for the closest shared center problem

This page was built for publication: A Polynomial Time Approximation Scheme for the Closest Shared Center Problem

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