New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

The broadcast storm problem in a mobile ad hoc network

Sze-Yao Ni, Yu‐Chee Tseng, Yuh‐Shyan Chen et al. · 1999 · 3.1K citations · Full text

Computing, Computer Engineering, Computer Science +14

Approximation algorithms for NP-complete problems on planar graphs

Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text

Computing, Computer Science, Mathematics +15

Routing in ad-hoc networks using minimum connected dominating sets

Bevan Das, V. Bharghavan · 2002 · 771 citations

Computing, Computer Science, Computer Networks +16

Planar Formulae and Their Uses

David Lichtenstein · SIAM Journal on Computing · 1982 · 754 citations

Natural Sciences, Computer Science, Mathematics +13

Approximation schemes for covering and packing problems in image processing and VLSI

Dorit S. Hochbaum, Wolfgang Maass · Journal of the ACM · 1985 · 750 citations · Full text

Computing, Computer Science, Algorithms +14