Min-Power Covering Problems

DOI10.1007/978-3-662-48971-0_32MaRDI QIDQ3459876zbMATH OpenOpenAlexFDO

Authors Vincent Chau, Alexander Kononov, Eric Angel, Evripidis Bampis

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_32

zbMATH Keywords

edge-weighted graphvertex cover problem

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial optimization (90C27)

Recommendations

• Improved approximation algorithms for minimum power covering problems
• Improved approximation algorithms for minimum power covering problems
• A note on the minimum power partial cover problem on the plane
• Minimum-diameter covering problems
• scientific article; zbMATH DE number 5583574
• Minimal covering problem and PLA minimization
• A primal-dual algorithm for the minimum power partial cover problem
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties

Cited in

(7)

• The minimum likely column cover problem
• Minimum power partial multi-cover on a line
• scientific article; zbMATH DE number 5936584 (Why is no real title available?)
• Improved approximation algorithms for minimum power covering problems
• Approximating power node-deletion problems
• Minimum shared‐power edge cut
• Approximating power node-deletion problems

This page was built for publication: Min-Power Covering Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459876)