scientific article; zbMATH DE number 2080196
From MaRDI portal
Publication:4472438
Recommendations
- On approximability of the independent/connected edge dominating set problems
- Approximation algorithms for connected dominating sets
- Approximation algorithms for connected dominating sets
- Computing and Combinatorics
- Approximating k-Connected m-Dominating Sets
- Approximating \(k\)-connected \(m\)-dominating sets
- On approximating the minimum independent dominating set
- Approximation hardness of edge dominating set problems
- Approximating edge dominating set in dense graphs
- Approximating edge dominating set in dense graphs
Cited in
(16)- On approximability of the independent/connected edge dominating set problems
- On approximating (connected) 2-edge dominating set by a tree
- Approximating \(k\)-connected \(m\)-dominating sets
- Improved budgeted connected domination and budgeted edge-vertex domination
- Weighted upper edge cover: complexity and approximability
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- scientific article; zbMATH DE number 1670653 (Why is no real title available?)
- On the max min vertex cover problem
- A Primal-Dual Method for Approximating Tree Cover with Two Weights
- On the max min vertex cover problem
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- Algorithms and Computation
- Weighted upper edge cover: complexity and approximability
- Computing and Combinatorics
- Approximating the minimum independent dominating set in perturbed graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472438)
