A network improvement problem under different norms
文献类型:期刊论文
作者 | Zhang, JZ; Yang, XG; Cai, MC |
刊名 | COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
![]() |
出版日期 | 2004-03-01 |
卷号 | 27期号:3页码:305-319 |
关键词 | network improvement problems location problem strongly polynomial algorithms inapproximability |
ISSN号 | 0926-6003 |
英文摘要 | In this paper, we first consider a network improvement problem, called vertex-to-vertices distance reduction problem. The problem is how to use a minimum cost to reduce lengths of the edges in a network so that the distances from a given vertex to all other vertices are within a given upper bound. We use l(infinity), l(1) and l(2) norms to measure the total modification cost respectively. Under l(infinity) norm, we present a strongly polynomial algorithm to solve the problem, and under l(1) or weighted l(2) norm, we show that achieving an approximation ratio O( log(|V|)) is NP-hard. We also extend the results to the vertex-to-points distance reduction problem, which is to reduce the lengths of edges most economically so that the distances from a given vertex to all points on the edges of the network are within a given upper bound. |
WOS研究方向 | Operations Research & Management Science ; Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000188330900005 |
出版者 | KLUWER ACADEMIC PUBL |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/1014] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Zhang, JZ |
作者单位 | 1.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Zhang, JZ,Yang, XG,Cai, MC. A network improvement problem under different norms[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS,2004,27(3):305-319. |
APA | Zhang, JZ,Yang, XG,&Cai, MC.(2004).A network improvement problem under different norms.COMPUTATIONAL OPTIMIZATION AND APPLICATIONS,27(3),305-319. |
MLA | Zhang, JZ,et al."A network improvement problem under different norms".COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 27.3(2004):305-319. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。