@inbook{d579adef7be544d6b38ac2bb7c94cf87,
title = "The closest vector problem on some lattices",
abstract = "The closest vector problem for general lattices is NP-hard. However, we can efficiently find the closest lattice points for some special lattices, such as root lattices (An, Dn and some En). In this paper, we discuss the closest vector problem on more general lattices than root lattices.",
keywords = "Closest vector, Dual lattice, Lattice, Root lattice",
author = "Haibin Kan and Hong Shen and Hong Zhu",
year = "2004",
doi = "10.1007/978-3-540-24680-0\_76",
language = "English",
isbn = "3540219935",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "446--449",
editor = "Minglu Li and Qianni Deng and Xian-He Sun and Jun Ni",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}