The Exact Subset MultiCover problem

DOI10.1007/978-3-031-20350-3_16MaRDI QIDQ6111957zbMATH OpenOpenAlexFDO

Authors Emile Benoist, Guillaume Fertin, Géraldine Jean

Publication date 4 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20350-3_16

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Exact algorithms for set multicover and multiset multicover problems
• The multicovering problem
• Exact multi-covering problems with geometric sets
• Approximating set multi-covers
• Exact hyperplane covers for subsets of the hypercube
• An exact algorithm for the maximal covering problem
• An approach to the solution of the set-covering problem
• An exact algorithm for a class of geometric set-cover problems
• On approximation of the submodular set cover problem
• A special case of set covering problems

Cites work

• A simplified NP-complete satisfiability problem
• Covering Problems with Hard Capacities
• Exact algorithms for set multicover and multiset multicover problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Reducibility among combinatorial problems

Cited in

(1)

• The \textsc{Exact Subset MultiCover} problem

This page was built for publication: The Exact Subset MultiCover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111957)