題名: | Finding Connected p-Centers on Interval Graphs |
作者: | Yen, William Chung-Kung Jr Yang, Shung C-S Jr |
關鍵字: | connected p-centers NP-Hard interval graphs clique path |
期刊名/會議名稱: | NCS 2009 |
摘要: | Let G(V, E) be an undirected and connected simple graph with n vertices. A positive weight 1w(v) is ociated to each vertex v and a positive length 2w(e) is ciated with each edge e. Given an integer p ≥ 1, the fundamental p-Center problem is to locate a p-vertex set Q of G for the establishment of facilities. Minimizing the maximum weighted distance for each vertex v in V – Q to its nearest facility site is the most important criteria. This paper focuses on the issue of finding connected p-centers on graphs, called the Connected p-Center problem (the CpC problem), which is a new practical variant from the p-Center problem. A p-center Q is connected if the subgraph induced by the vertices in Q is connected. Under the assumption that the clique path is given, this paper designs an O(n)-time algorithm for the CpC problem on interval graphs with 1w(v) = 1, for all tices v, and 2w(e) = 1, for all edges e. |
日期: | 2011-02-21T23:27:11Z |
分類: | 2009年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
AB 1-2.pdf | 110.8 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。