Approximation algorithms for partial vertex covers in trees
From MaRDI portal
Cites work
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Applications of approximation algorithms to cooperative games
- Approximation algorithms for partial covering problems
- Approximation of Partial Capacitated Vertex Cover
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
- Finding kth paths and p-centers by generating and searching good data structures
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1182766 (Why is no real title available?)
- scientific article; zbMATH DE number 1947055 (Why is no real title available?)
- On the hardness of approximating minimum vertex cover
- Optimization, approximation, and complexity classes
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Reducibility among combinatorial problems
- Using homogeneous weights for approximating the partial cover problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(2)
This page was built for publication: Approximation algorithms for partial vertex covers in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554733)
