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
AbstractIn this paper we will define some special p-center problem in view of practical applications...
AbstractGeneralizing a result of Hochbaum and Shmoys, a polynomial algorithm with a worst-case error...
The (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) suc...
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...
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 ...
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...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and ...
This research focuses on the k-center problem and its applications. Different methods for solving th...
The (k, r)-center problem asks whether an input graph G has k vertices (called centers) such tha...
Abstract. The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) ...
The (k; r)-center problem asks whether an input graph G has k vertices (called centers) such that ...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
AbstractIn this paper we will define some special p-center problem in view of practical applications...
AbstractGeneralizing a result of Hochbaum and Shmoys, a polynomial algorithm with a worst-case error...
The (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) suc...
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...
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 ...
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...
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and ...
This research focuses on the k-center problem and its applications. Different methods for solving th...
The (k, r)-center problem asks whether an input graph G has k vertices (called centers) such tha...
Abstract. The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) ...
The (k; r)-center problem asks whether an input graph G has k vertices (called centers) such that ...
AbstractIt is widely believed that showing a problem to be NP-complete is tantamount to proving its ...
AbstractIn this paper we will define some special p-center problem in view of practical applications...
AbstractGeneralizing a result of Hochbaum and Shmoys, a polynomial algorithm with a worst-case error...
The (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) suc...
DOI
Add to ORKG