New approximations for Maximum Lifetime Coverage

DOI10.1080/02331934.2014.883507zbMath1291.90044OpenAlexW2031395137MaRDI QIDQ5169461

Ding-Zhu Du, Lidong Wu, James Willson, Weili Wu, Ling Ding

Publication date: 10 July 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.883507

zbMATH Keywords

approximationoptimal solutionsensor covermaximum lifetime coverageminimum weight set cover

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ Constant-approximation for minimum weight partial sensor cover

Cites Work

• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
• Design and analysis of approximation algorithms
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• A better constant-factor approximation for weighted dominating set in unit disk graph

This page was built for publication: New approximations for Maximum Lifetime Coverage