Covering a Graph with a Constrained Forest (Extended Abstract)

DOI10.1007/978-3-642-10631-6_90zbMath1272.05188OpenAlexW1484856186MaRDI QIDQ3652276

Basile Couëtoux, Zsolt Tuza, Cristina Bazgan

Publication date: 17 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_90

zbMATH Keywords

undirected graphedge weights

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

The Complexity and Approximability of Minimum Contamination Problems

This page was built for publication: Covering a Graph with a Constrained Forest (Extended Abstract)