A Primal-Dual Method for Approximating Tree Cover with Two Weights
From MaRDI portal
Cites work
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Approximating the tree and tour covers of a graph
- Depth-first search and the vertex cover problem
- scientific article; zbMATH DE number 3869066 (Why is no real title available?)
- Improved approximations for tour and tree covers
- On approximability of the independent/connected edge dominating set problems
- The Rectilinear Steiner Tree Problem is NP-Complete
This page was built for publication: A Primal-Dual Method for Approximating Tree Cover with Two Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439142)