Minimum sum vertex cover: kernelization and parameterized algorithms
From MaRDI portal
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- Approximating min sum set cover
- Nondeterminism within $P^ * $
- On min sum vertex cover and generalized min sum set cover
- Parameterized algorithms for minimum sum vertex cover
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Some results on approximability of minimum sum vertex cover
This page was built for publication: Minimum sum vertex cover: kernelization and parameterized algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970737)
