summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the $p$-median problem are $NP$-complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal $m$-center problem is also $NP$-complete
Abstract. The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) ...
Cataloged from PDF version of article.We consider the absolute p-center problem on a general network...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
This research focuses on the k-center problem and its applications. Different methods for solving th...
International audienceWe consider the k most vital edges (nodes) and min edge (node) blocker version...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the p-median and ...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
AbstractIn this paper we will define some special p-center problem in view of practical applications...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and ...
In this paper we study the hardness of the k-Center problem on inputs that model transportation netw...
This research focuses on the k-center problem and its applications. Different methods for solving th...
In an earlier paper [Hud91], two "alternative" p-Center problems, where the centers servin...
Originally presented as the author's Ph. D. thesis, M.I.T. Dept. of Aeronautics and Astronautics, 19...
Abstract. The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) ...
Cataloged from PDF version of article.We consider the absolute p-center problem on a general network...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
This research focuses on the k-center problem and its applications. Different methods for solving th...
International audienceWe consider the k most vital edges (nodes) and min edge (node) blocker version...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the p-median and ...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
AbstractIn this paper we will define some special p-center problem in view of practical applications...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and ...
In this paper we study the hardness of the k-Center problem on inputs that model transportation netw...
This research focuses on the k-center problem and its applications. Different methods for solving th...
In an earlier paper [Hud91], two "alternative" p-Center problems, where the centers servin...
Originally presented as the author's Ph. D. thesis, M.I.T. Dept. of Aeronautics and Astronautics, 19...
Abstract. The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) ...
Cataloged from PDF version of article.We consider the absolute p-center problem on a general network...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
DOI
Add to ORKG