Greedy additive approximation algorithms for minimum-entropy coupling problem

Massimiliano Rossi. Greedy additive approximation algorithms for minimum-entropy coupling problem. In IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019. pages 1127-1131, IEEE, 2019. [doi]

@inproceedings{Rossi19-1,
  title = {Greedy additive approximation algorithms for minimum-entropy coupling problem},
  author = {Massimiliano Rossi},
  year = {2019},
  doi = {10.1109/ISIT.2019.8849717},
  url = {https://doi.org/10.1109/ISIT.2019.8849717},
  researchr = {https://researchr.org/publication/Rossi19-1},
  cites = {0},
  citedby = {0},
  pages = {1127-1131},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019},
  publisher = {IEEE},
  isbn = {978-1-5386-9291-2},
}