Unweighted p-center problem on extended stars
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on t...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University, Rasht Branch
2014-07-01
|
Series: | Iranian Journal of Optimization |
Subjects: | |
Online Access: | http://ijo.iaurasht.ac.ir/article_526830_37ef51736b0d3ec69e1bab922522c3ec.pdf |