Towards Optimal and Expressive Kernelization for d-Hitting Set-Reference-Cited by-同舟云学术

Towards Optimal and Expressive Kernelization for d-Hitting Set

Published:2012 Issue: Volume: Page:121-132
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

van Bevern René

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32241-9_11

Reference22 articles.

1. Abtreu, R., Zoeteweij, P., van Gemund, A.J.C.: A dynamic modeling approach to software multiple-fault localization. In: Proc. 19th DX, pp. 7–14. Blue Mountains, NSW, Australia (2008)

2. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)

3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley (1983)

4. Lecture Notes in Computer Science;R. Bevern van,2012

5. van Bevern, R., Moser, H., Niedermeier, R.: Approximation and tidying—a problem kernel for s-plex cluster vertex deletion. Algorithmica 62(3), 930–950 (2012)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hitting and Covering Partially;Lecture Notes in Computer Science;2018

2. A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity;Science China Information Sciences;2017-02-09

3. A novel local search algorithm with configuration checking and scoring mechanism for the setk-covering problem;International Transactions in Operational Research;2016-04-20

4. Streaming Kernelization;Mathematical Foundations of Computer Science 2014;2014

5. A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem;Graph-Theoretic Concepts in Computer Science;2013