A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection

Dan Bogdanov, Keita Emura, Roman Jagomägis, Akira Kanaoka, Shin’ichiro Matsuo, Jan Willemson

Open source

DOI
10.1007/978-3-662-43826-8_8
Published
2014
Container
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Open access
unknown

Credibility signals

uncertain Score 64/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-662-43826-8_8,
  title = {A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection},
  author = {Dan Bogdanov and Keita Emura and Roman Jagomägis and Akira Kanaoka and Shin’ichiro Matsuo and Jan Willemson},
  year = {2014},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/978-3-662-43826-8_8},
  url = {https://doi.org/10.1007/978-3-662-43826-8_8}
}

RIS

TY  - JOUR
TI  - A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection
AU  - Dan Bogdanov
AU  - Keita Emura
AU  - Roman Jagomägis
AU  - Akira Kanaoka
AU  - Shin’ichiro Matsuo
AU  - Jan Willemson
PY  - 2014
JO  - Lecture Notes in Computer Science
DO  - 10.1007/978-3-662-43826-8_8
UR  - https://doi.org/10.1007/978-3-662-43826-8_8
ER  - 

APA

Bogdanov, D., Emura, K., Jagomägis, R., Kanaoka, A., Matsuo, S., & Willemson, J. (2014). A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-43826-8_8

Source records