Distributed routing schemes for ad hoc networks using d-SPR sets

Approximation algorithms for combinatorial problems

David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations

Engineering, Combinatorial Problem, Computational Complexity +6

On the ratio of optimal integral and fractional covers

László Lovász · Discrete Mathematics · 1975 · 1.1K citations

Mathematical Programming, Fractional Covers, Engineering +4

Approximation Algorithms for Connected Dominating Sets

Suvajyoti Guha, Samir Khuller · Algorithmica · 1998 · 1.1K citations

Engineering, Extremal Set Theory, Extremal Combinatorics +5

Max-min d-cluster formation in wireless ad hoc networks

A.D. Amis, Ravi Prakash, T.H.P. Vuong et al. · 2002 · 982 citations

Heuristic Terminates, Topology Control, Network Science +8

Routing in ad-hoc networks using minimum connected dominating sets

Bevan Das, V. Bharghavan · 2002 · 765 citations

Updating Routes, Network Routing Algorithm, Network Science +14