Kernelization Algorithms for d-Hitting Set Problems

Faisal N. Abu-Khzam

Open source

DOI
10.1007/978-3-540-73951-7_38
Published
Not recorded
Container
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Open access
unknown

Credibility signals

uncertain Score 58/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-540-73951-7_38,
  title = {Kernelization Algorithms for d-Hitting Set Problems},
  author = {Faisal N. Abu-Khzam},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-540-73951-7_38},
  url = {https://doi.org/10.1007/978-3-540-73951-7_38}
}

RIS

TY  - JOUR
TI  - Kernelization Algorithms for d-Hitting Set Problems
AU  - Faisal N. Abu-Khzam
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-540-73951-7_38
UR  - https://doi.org/10.1007/978-3-540-73951-7_38
ER  - 

APA

Abu-Khzam, F. N. (n.d.). Kernelization Algorithms for d-Hitting Set Problems. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-73951-7_38

Source records