Solving the k-center problem efficiently with a dominating set algorithm

Journal of Computing and Information Technology

Volumn 13, Issue 3, 2005, Pages 225-234

  Mihelič, Jurij ^a   Robič, Borut ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Combinatorial problems; Dominating set; Facility location; Graph algorithms; K center; Performance evaluation

Indexed keywords

HEURISTIC ALGORITHMS;

COMBINATORIAL PROBLEM; DOMINATING SETS; FACILITY LOCATIONS; GRAPH ALGORITHMS; K-CENTER; PERFORMANCE EVALUATION;

POLYNOMIAL APPROXIMATION;

EID: 79951764274     PISSN: 13301136     EISSN: 18463908     Source Type: Journal    
DOI: 10.2498/cit.2005.03.05     Document Type: Article

References (17)

1. J.E. BEASLEY, A note on solving large p-median problems, European J. Oper. Res., 21:270-273, 1985
2. M.E.DYER AND A.M. FRIEZE, Asimple heuristic for the p-centre problem, Operations Research Letters, 3:6:285-288, 1985
3. M.S. DASKIN, Network and Discrete Location: Models Algorithms and Applications, Wiley, New York, 1995
4. M.S. DASKIN, A new approach to solving the vertex p-center problem to optimality: Algorithm and computational results, Communications of the Operations Research Society of Japan, 45:9:428-436, 2000
5. S. ELLOUMI, M. LABBE, AND Y. POCHET, New formulation and resolution method for the p-center problem, 2001. http://www.optimization-online.org/DB HTML/2001/10/394.html
6. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NPCompleteness, W.H. Freeman and Co., San Francisco, 1979
7. T. GONZALEZ, Clustering to minimize the maximum intercluster distance, Theoretical Computer Science., 38:293-306, 1985
8. D.S. HOCHBAUM, ed., Approximation Algorithms for NP-hard Problems, PWS publishing company, Boston, 1995
9. D.S. HOCHBAUM AND D.B. SHMOYS, A best possible heuristic for the k-center problem, Mathematics of Operations Research, 10:180-184, 1985
10. T. ILHAN AND M.C. PINAR, An efficient exact algorithm for the vertex p-center problem, 2001. http.//www.optimization-online.org/DB_HTML/2001/09/376.html
11. E. MINIEKA, The m-center problem, SIAM Rev., 12:138-139, 1970
12. N.MLADENOVIĆ, M. LABBE, AND P. HANSEN, Solving the p-center problem with tabu search and variable neighborhood search, Networks 42(1):48-64, 2003
13. J. MIHELIČ AND B. ROBIČ, Approximation algorithms for k-center problem: an experimental evaluation, Proc. OR 2002, Klagenfurt, Austria, 2002
14. J. PLESNIK, A Heuristic for the p-Center Problem in Graphs, Discrete Applied Mathematics 17:263-268, 1987
15. CHARLES S. REVELLE AND H.A. EISELT, Location analysis: A synthesis and survey, European Journal of Operational Research, 165:1-19, 2005
16. D.B. SHMOYS, Computing near-optimal solutions to combinatorial optimization problems, Technical report, Ithaca, NY 14853, 1995. http://citeseer.nj.nec.com/shmoys95 computing.html
17. V. VAZIRANI, Aproximation Algorithms, Springer, 2001