Inapproximability and a polynomially solvable special case of a network improvement problem

doi:10.1016/S0377-2217(02)00876-7

CSpace

	Inapproximability and a polynomially solvable special case of a network improvement problem
	Zhang, JZ ; Yang, XG ; Cai, MC
	2004-05-16
发表期刊	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
ISSN	0377-2217
卷号	155 期号:1 页码:251-257
摘要	We consider a network improvement problem in which we wish to spend as little as possible to ensure that the distances from a given vertex to all other vertices are within given bounds. We first prove that achieving an approximation ratio (1 + epsilon) is NP-hard for some constant epsilon > 0. Then we show that the problem can be solved by a combinatorial algorithm running in O(\V\log\V\) time when the network is restricted to a tree. (C) 2003 Elsevier B.V. All rights reserved.
关键词	network flows shortest path MAXIMUM 3-SATISFIABILITY inapproximability
DOI	10.1016/S0377-2217(02)00876-7
语种	英语
WOS研究方向	Business & Economics ; Operations Research & Management Science
WOS类目	Management ; Operations Research & Management Science
WOS记录号	WOS:000188508900016
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19619
专题	中国科学院数学与系统科学研究院
通讯作者	Zhang, JZ
作者单位	1.City Univ Hong Kong, Dept Math, Kowloon, 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. Inapproximability and a polynomially solvable special case of a network improvement problem[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,2004,155(1):251-257.
APA	Zhang, JZ,Yang, XG,&Cai, MC.(2004).Inapproximability and a polynomially solvable special case of a network improvement problem.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,155(1),251-257.
MLA	Zhang, JZ,et al."Inapproximability and a polynomially solvable special case of a network improvement problem".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 155.1(2004):251-257.