Hitting and covering partially

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

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

Publication date: 4 October 2018

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

zbMATH Keywords

kernelexact algorithm\(k\)-maximum coveragepartial \(d\)-hitting setpartial \(d\)-set coverpartial vertex cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Hitting and covering partially