On inverse problems of optimum perfect matching | |
Liu, ZH; Zhang, JZ | |
刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
![]() |
2003-09-01 | |
卷号 | 7期号:3页码:215-228 |
关键词 | maximum-weight matching perfect matching maximum-mean alternating cycle ellipsoid method strongly polynomial algorithm linear programming |
ISSN号 | 1382-6905 |
英文摘要 | As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l(1) or l(infinity) norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l(1) and l(infinity) norms. It has been proved that the inverse maximum-weight perfect matching under l(infinity) norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l(1) norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l(1) and l(infinity) norms are solvable in polynomial time. |
WOS研究方向 | Computer Science ; Mathematics |
语种 | 英语 |
出版者 | KLUWER ACADEMIC PUBL |
WOS记录号 | WOS:000186285200001 |
内容类型 | 期刊论文 |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18169] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Liu, ZH |
作者单位 | 1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China |
推荐引用方式 GB/T 7714 | Liu, ZH,Zhang, JZ. On inverse problems of optimum perfect matching[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2003,7(3):215-228. |
APA | Liu, ZH,&Zhang, JZ.(2003).On inverse problems of optimum perfect matching.JOURNAL OF COMBINATORIAL OPTIMIZATION,7(3),215-228. |
MLA | Liu, ZH,et al."On inverse problems of optimum perfect matching".JOURNAL OF COMBINATORIAL OPTIMIZATION 7.3(2003):215-228. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论