A Note on the p−Center Problem
Nader Jafari Rad (2011)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “On the interchange heuristic for locating centers and medians in a graph”
A Note on the p−Center Problem
Shields-Harary numbers of graphs with respect to continuous concave cost functions.
Holliday, John, Johnson, Peter (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring.
Halldórsson, Magnús M., Lau, Hoong Chuin (1997)
Journal of Graph Algorithms and Applications
Similarity:
A factor-two approximation algorithm for two-dimensional phase unwrapping.
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
Contraction and treewidth lower bounds.
Bodlaender, Hans L., Wolle, Thomas, Koster, Arie M.C.A. (2006)
Journal of Graph Algorithms and Applications
Similarity:
Two heuristics for the absolute -center problem in graphs
Ján Plesník (1988)
Mathematica Slovaca
Similarity:
Network Models of Massive Datasets
Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos (2004)
Computer Science and Information Systems
Similarity:
Irregularity strength of regular graphs.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the computational complexity of centers locating in a graph
Ján Plesník (1980)
Aplikace matematiky
Similarity:
It is shown that the problem of finding a minimum -basis, the -center problem, and the -median problem are -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal -center problem is also -complete.