Min-Power Covering Problems

DOI10.1007/978-3-662-48971-0_32zbMath1476.05163OpenAlexW2407680873MaRDI QIDQ3459876

Vincent Chau, Alexander V. 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

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

Related Items (4)

Parameterized Power Vertex Cover ⋮ Approximating power node-deletion problems ⋮ Minimum shared‐power edge cut ⋮ Computing a tree having a small vertex cover

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