An analysis between exact and approximate algorithms for the k-center problem in graphs (original) (raw)
Related papers
HAL (Le Centre pour la Communication Scientifique Directe), 2019
Dynamic algorithms for k-center on graphs
arXiv (Cornell University), 2023
Approximation algorithms for the k-center problem: an experimental evaluation
Examining Heuristics for the K-Centers Problem
K. Senthilkumar, Arka Mukherjee
International Journal of Engineering & Technology, 2018
On the k-center Problem in Social Networks
A novel approach to solve K-center problems with geographical placement
2015 IEEE International Conference on Service Operations And Logistics, And Informatics (SOLI), 2015
Solving the k-center Problem Efficiently with a Dominating Set Algorithm
Journal of Computing and Information Technology, 2005
The probabilistic k-center problem
2018
An Optimal Algorithm to flnd Centres and Diameter of a Circular-Arc Graph
2007
An Evaluation of K-Center Problem Solving Techniques,towards Optimality
A finite algorithm for the continuousp-center location problem on a graph
Mathematical Programming, 1985
An Optimal Algorithm to find Centres and Diameter of a Circular-Arc Graph
Citeseer
Heuristic Approaches for K-Center Problem
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications, 1997
Distributed algorithms for locating centers and medians in communication networks
Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, 1992
The complete vertex p-center problem
The Complete Vertex p-Center Problem, 2020
The capacitated centred clustering problem
Computers & Operations Research, 2006
A hybrid algorithm for the path center problem
2016
Approximability Results for the p-Center Problem Algorithm Design and Analysis
Solving the constrained p-center problem using heuristic algorithms
Applied Soft Computing, 2011
A linear algorithm for centering a spanning tree of a biconnected graph
Information Processing Letters, 1994
Self-Stabilizing Algorithms for Finding Centers and
SIAM J. Comput., 1999
A note on the p - center problem
Yugoslav Journal of Operations Research, 2011
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM, 2005
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics, 2008
Optimal algorithms for the α-neighbor p-center problem
European Journal of Operational Research, 2013
The Analytical Study of K-Center Problem solving techniques
Efficient Algorithms for the Weighted 2Center Problem in a Cactus Graph
2005
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science, 2007
An Optimal Algorithm for the Continuous/Discrete Weighted 2Center Problem in Trees
2006
A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
Computational Optimization and Applications, 2012
The k-centrum multi-facility location problem
Discrete Applied Mathematics, 2001