problem: an experimental evaluation Jurij Mihelic and Borut Robic Faculty of...  Home/Search
Context
Related
| lalg.fri.unilj.si...terExperiments.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lalg.fri.unilj...ndex.php?id=bib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete location theory. Informally, given a set of cities, with intercity distances specified, one has to pick k cities and build warehouses in them so as to minimize the maximum distance of any city from its closest warehouse. We examine several approximation algorithms that achieve approximation factor of 2 as well as other heuristic algorithms. In particular, we focus on the clustering algorithm by... (Update)
Active bibliography (related documents): More All
0.7: Facility Location and Covering Problems - Jurij Mihelic And (Correct)
0.3: Solving the p-Center Problem with Tabu Search and.. - Mladenovic.. (2000) (Correct)
0.2: New Formulation And Resolution - Method For The (Correct)
Similar documents based on text: More All
0.4: Improved Schemes for Mapping Arbitrary Algorithms Onto.. - Robic, Vilfan (Correct)
0.3: Asynchrony in parallel computing: From dataflow to.. - Silc, Robic, Ungerer (1997) (Correct)
0.3: Processor Allocation Based on Weighted Bipartite Matching.. - Silc, Robic (Correct)
BibTeX entry: (Update)
@misc{ experimental-approximation,
author = "Problem An Experimental",
title = "Approximation Algorithms for the K-Center",
url = "citeseer.ist.psu.edu/728770.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
318 Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1995
45 A best possible heuristic for the k-center problem (context) - Hochbaum, Shmoys - 1985
34 Computing near-optimal solutions to combinatorial optimizati.. - Shmoys - 1995
15 A note on solving large p-median problems (context) - Beasley - 1985
4 Network and Discrete Location: Models Algorithms and Applica.. (context) - Daskin - 1995
4 A new approach to solving the vertex p-center problem to opt.. (context) - Daskin - 2000
4 center problem (context) - Minieka - 1970
1 New formulation and resolution method for the p-center probl.. (context) - Elloumi, Labbe et al. - 2001
1 center problem with tabu search and variable neighborhood se.. (context) - Mladenovic, Labbe et al. - 2000
1 cient exact algorithm for the vertex p-center problem (context) - Ilhan, Pinar - 2001
1 Clustering to minimize the maximum inercluster distance (context) - Gonzalez - 1985
Documents on the same site (http://lalg.fri.uni-lj.si/~jure/index.php?id=bib):
Facility Location and Covering Problems - Jurij Mihelic And (Correct)
Facility Location and Covering Problems - Jurij Miheli University (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC