Approximating the minimum weight weak vertex cover
From MaRDI portal
Recommendations
Cites work
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Domination in Graphs Applied to Electric Power Networks
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 3708436 (Why is no real title available?)
- scientific article; zbMATH DE number 1919454 (Why is no real title available?)
- Introduction to algorithms
- The importance of being biased
Cited in
(8)- A distributed algorithm for monitor-nodes selection in net traffic measurement
- scientific article; zbMATH DE number 1919454 (Why is no real title available?)
- Computing and Combinatorics
- Algorithm for the network flow monitoring set based on primal-dual method
- Algorithmic Applications in Management
- Delay-tolerant distributed algorithms for decision-making in vehicular networks
- A multi-start gradient combination method for high-performance global search
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem
This page was built for publication: Approximating the minimum weight weak vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860818)