Some new results on inverse sorting problems

CSpace

	Some new results on inverse sorting problems
	Yang, XG ; Zhang, JZ
	2005
发表期刊	COMPUTING AND COMBINATORICS, PROCEEDINGS
ISSN	0302-9743
卷号	3595 页码:985-992
摘要	In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, which can be solved in O(n(2)) time. The second type is a family of partial inverse sorting problems which we can further divide into two kinds, with free positions and with fixed positions. We show that both types of partial inverse sorting problems can be solved by a combination of a sorting problem and an inverse sorting problem.
关键词	sorting problem inverse problem partial inverse problem Hamming distance optimization
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000231866900099
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/2223
专题	中国科学院数学与系统科学研究院
通讯作者	Yang, XG
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
推荐引用方式 GB/T 7714	Yang, XG,Zhang, JZ. Some new results on inverse sorting problems[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS,2005,3595:985-992.
APA	Yang, XG,&Zhang, JZ.(2005).Some new results on inverse sorting problems.COMPUTING AND COMBINATORICS, PROCEEDINGS,3595,985-992.
MLA	Yang, XG,et al."Some new results on inverse sorting problems".COMPUTING AND COMBINATORICS, PROCEEDINGS 3595(2005):985-992.