Results 1  10
of
1,188
Generalized kCenter Problems
"... The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this p ..."
Abstract
 Add to MetaCart
The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization
The Capacitated KCenter Problem
 In Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1136
, 1996
"... The capacitated Kcenter problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assign ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
The capacitated Kcenter problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may
The pNeighbor kCenter Problem
, 1998
"... The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this p ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization
Fault Tolerant KCenter Problems
, 1997
"... The basic Kcenter problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NPhard, and se ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
The basic Kcenter problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NP
Heuristic Approaches for KCenter Problem
"... Abstract The allocation of distribution centers or the When we have to select a subset of objects, the greedy facility center is an important issue for any company. The heuristic is used. Usually sequential approach applied in which problem of facility location is faced by both new and existing in ..."
Abstract
 Add to MetaCart
until the required is equally important for both private as well as the public numbers of sites are identified. For this reason this approach is sector. The kcenter problem is one of the basic problems in called as Greedy Heuristic, specifically it is known as Greedyfacility location. The aim
Approximation Algorithm for the Kinetic Robust KCenter Problem
, 2009
"... Two complications frequently arise in realworld applications, motion and the contamination of data by outliers. We consider a fundamental clustering problem, the kcenter problem, within the context of these two issues. We are given a finite point set S of size n and an integer k. In the standard k ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Two complications frequently arise in realworld applications, motion and the contamination of data by outliers. We consider a fundamental clustering problem, the kcenter problem, within the context of these two issues. We are given a finite point set S of size n and an integer k. In the standard
kCenter problems with minimum coverage
, 2005
"... In this work, we study an extension of the kcenter facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centers while allowing each center to cater to a spread of clients. We study three variants ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this work, we study an extension of the kcenter facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centers while allowing each center to cater to a spread of clients. We study three variants
Approximation Algorithm for the Kinetic Robust KCenter Problem
"... Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the kcenter problem. We are given a discrete point set S and a constant integer k, and the goal is to compute a set of k center points to minimize the maximum distance ..."
Abstract
 Add to MetaCart
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the kcenter problem. We are given a discrete point set S and a constant integer k, and the goal is to compute a set of k center points to minimize the maximum
Approximation algorithms for kcenter problem: an experimental evaluation
 Proc. OR 2002
, 2002
"... Abstract. In this paper we deal with the vertex kcenter 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 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. In this paper we deal with the vertex kcenter 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
Solving the kcenter problem efficiently with a dominating set algorithm
, 2005
"... We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum αallneighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum kcenter problem in poly ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum αallneighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum kcenter problem
Results 1  10
of
1,188