A New Proof for Zassenhaus-Groemer-Oler inequality
暂无分享,去创建一个
Yin-Feng Xu | Qinghai Liu | Xiang Li | Weili Wu | Lidong Wu | Xiao-Dong Hu | Zhao Zhang | Hai Du | Yinfeng Xu | Weili Wu | Xiaodong Hu | Zhao Zhang | Lidong Wu | Qinghai Liu | Xiang Li | Hai Du
[1] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[2] R. Graham,et al. A Packing Inequality for Compact Convex Subsets of the Plane , 1969, Canadian Mathematical Bulletin.
[3] Helmut Groemer,et al. Über die Einlagerung von Kreisen in einen konvexen Bereich , 1960 .
[4] Xiaohua Jia,et al. Maximum Independent Set of Links under Physical Interference Model , 2009, WASA.
[5] Deying Li,et al. Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.
[6] Hans Zassenhaus,et al. Modern developments in the geometry of numbers , 1961 .
[7] Xiaohua Jia,et al. Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.
[8] N. Oler,et al. An inequality in the geometry of numbers , 1961 .