On the generalized obnoxious center problem: antimedian subsets
| Data(s) |
22/07/2014
22/07/2014
14/02/2008
|
|---|---|
| Resumo |
The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered. Cochin University of Science and Technology |
| Identificador | |
| Idioma(s) |
en |
| Palavras-Chave | #graph distance #remoteness #antimedian set #computational complexity #linear programming |
| Tipo |
Article |
