Hitting and covering partially

DOI10.1007/978-3-319-94776-1_62MaRDI QIDQ1791047

Saket Saurabh, Vibha Sahlot, Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pratibha Choudhary

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_62

zbMATH Keywords

kernel; exact algorithm; \(k\)-maximum coverage; partial \(d\)-hitting set; partial \(d\)-set cover; partial vertex cover

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization