DocumentCode
2453171
Title
The inverse 1-median problem on star graphs
Author
Yan-Qin, Bai ; Qin, Wang ; Wei-Ying, Tai
Author_Institution
Dept. of Math., China Jiling Univ., Hangzhou, China
fYear
2010
fDate
24-27 Aug. 2010
Firstpage
78
Lastpage
80
Abstract
In this paper, we mainly discuss the inverse 1-median problem on star graphs with non-negative edge lengths and positive vertex weights. The inverse 1-median problem considered in this paper is to change the edge lengths at the minimum cost so that a given vertex becomes the 1-median of the network. We show that this problem can be solved efficiently in O(n) time.
Keywords
graph theory; inverse problems; inverse 1-median problem; nonnegative edge length; positive vertex weight; star graph; Algorithm design and analysis; Electronic mail; Hospitals; Optimization; Switches; Wheels; 1-median; inverse problem; star graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Education (ICCSE), 2010 5th International Conference on
Conference_Location
Hefei
Print_ISBN
978-1-4244-6002-1
Type
conf
DOI
10.1109/ICCSE.2010.5593677
Filename
5593677
Link To Document