Privacy sets for constrained space-filling
Methodology
2015-10-20 v1
Abstract
The paper provides typology for space filling into what we call "soft" and "hard" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples.
Keywords
Cite
@article{arxiv.1510.05284,
title = {Privacy sets for constrained space-filling},
author = {Eva Benková and Radoslav Harman and Werner G. Müller},
journal= {arXiv preprint arXiv:1510.05284},
year = {2015}
}