NP-completeness of some type of p-center problem
- Kikuno, Tohru
- Yoshida, Noriyoshi
- Kakuda, Yoshiaki
DOIAbstract
AbstractIn this paper we will define some special p-center problem in view of practical applications and prove its NP-completeness
AbstractIn this paper we will define some special p-center problem in view of practical applications and prove its NP-completeness
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
Center location on cactus graphs. The p-center problem has been shown to be NP-hard for case of a ge...
An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P- center problem is prop...
In an earlier paper [Hud91], two "alternative" p-Center problems, where the centers servin...
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...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The p-center problem is a relatively well known facility location problem thatinvolves locating p id...
The vertex p-center problem consists of locating p facilities among a set of M potential sites such ...
AbstractGiven n demand points in the plane, the p-centre problem is to locate p supply points so as ...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
AbstractLet G(V,E,w,l) denote an n-vertex and m-edge graph in which w is a function mapping each ver...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
Center location on cactus graphs. The p-center problem has been shown to be NP-hard for case of a ge...
An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P- center problem is prop...
In an earlier paper [Hud91], two "alternative" p-Center problems, where the centers servin...
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...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The p-center problem is a relatively well known facility location problem thatinvolves locating p id...
The vertex p-center problem consists of locating p facilities among a set of M potential sites such ...
AbstractGiven n demand points in the plane, the p-centre problem is to locate p supply points so as ...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
AbstractLet G(V,E,w,l) denote an n-vertex and m-edge graph in which w is a function mapping each ver...
summary:It is shown that the problem of finding a minimum $k$-basis, the $n$-center problem, and the...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
Center location on cactus graphs. The p-center problem has been shown to be NP-hard for case of a ge...
An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P- center problem is prop...
Add to ORKG