A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY

DOI10.1142/S1793830912500140zbMath1254.52006MaRDI QIDQ3166725

Lidong Wu, Xiang Li, Hai Du, Weili Wu, Qinghai Liu, Xiao-Dong Hu, Zhao Zhang, Yin-Feng Xu

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

sensor networkdisc packing

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Elementary problems in Euclidean geometries (51M04) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items (2)

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs ⋮ A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network

Cites Work

• Über die Einlagerung von Kreisen in einen konvexen Bereich
• An inequality in the geometry of numbers
• Modern developments in the geometry of numbers
• A Packing Inequality for Compact Convex Subsets of the Plane

This page was built for publication: A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY