Funder
Natural Science Foundation of Hebei Province
NSF of China
Hebei Province Foundation for Returnees
Overseas Expertise Introduction Program of Hebei Auspices
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference24 articles.
1. Bringmann K, Kozma L, Moran S, Narayanaswamy NS (2016) Hitting set for hypergraphs of low VC-dimension. In: LIPIcs-Leibniz international proceedings in informatics. 24th annual European symposium on algorithms. ESA 2016. Schloss Dagstuhl-Leibniz-Zentrum f$$\ddot{u}$$r Informatik. Dagstuhl Publishing, Germany, pp 1–18
2. Bus N, Mustafa N, Ray S (2018) Practical and efficient algorithms for the geometric hitting set problem. J Discrete Appl Math 240:25–32
3. Carastan-Santos D, Camargo R, Martin D, Song S, Rozante L (2017) Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters. Future Gener Comput Syst 67:418–429
4. Du D, Ko K, Hu X (2011) Design and analysis of approximation algorithms. Springer, New York
5. Eiter T, Gottlob G (1995) Identifying the minimal transversals of a hypergraph and related problems. SIAM J Comput 24:1–2