# zbMATH — the first resource for mathematics

New approximations for maximum lifetime coverage. (English) Zbl 1291.90044
Summary: We present a new polynomial-time approximation scheme for the well-known Maximum Lifetime Coverage problem in wireless sensor networks. For any $$\epsilon > 0$$, this scheme contains an approximation algorithm with performance $$3+\epsilon$$, which improves the performance ratio $$4+\epsilon$$ of previously known approximation in the literature.
##### MSC:
 90B10 Deterministic network models in operations research 90B35 Deterministic scheduling theory in operations research 94C15 Applications of graph theory to circuits and networks 90C60 Abstract computational complexity for mathematical programming problems
Full Text:
##### References:
 [1] DOI: 10.1142/S021926590200063X · doi:10.1142/S021926590200063X [2] DOI: 10.1007/s11276-005-6615-6 · Zbl 02225394 · doi:10.1007/s11276-005-6615-6 [3] DOI: 10.1007/s10878-008-9146-0 · Zbl 1184.05090 · doi:10.1007/s10878-008-9146-0 [4] DOI: 10.1007/978-1-4614-1701-9 · Zbl 1237.68009 · doi:10.1007/978-1-4614-1701-9 [5] DOI: 10.1016/j.tcs.2008.11.015 · Zbl 1162.68042 · doi:10.1016/j.tcs.2008.11.015 [6] DOI: 10.1016/j.tcs.2009.06.022 · Zbl 1209.68389 · doi:10.1016/j.tcs.2009.06.022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.