An optimal algorithm for the minimum disc cover problem

DOI10.1007/s00453-007-9043-4zbMath1154.68032OpenAlexW1974480928MaRDI QIDQ2471803

Chih-Wei Yi, Ten-Hwang Lai, Min-Te Sun, Chuan-kai Yang

Publication date: 18 February 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9043-4

zbMATH Keywords

Optimal algorithmsApplications in ad hoc networksMinimum disc cover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (2)

Polynomial time approximation schemes for minimum disk cover problems ⋮ MINIMUM LOCAL DISK COVER SETS FOR BROADCASTING IN HETEROGENEOUS MULTIHOP WIRELESS NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of computations under varying sets of primitives
• The broadcast storm problem in a mobile ad hoc network
• On the shape of a set of points in the plane

This page was built for publication: An optimal algorithm for the minimum disc cover problem