Max-Sum Diversity Via Convex Programming

Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen. Max-Sum Diversity Via Convex Programming. In Sándor P. Fekete, Anna Lubiw, editors, 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. Volume 51 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{CevallosEZ16,
  title = {Max-Sum Diversity Via Convex Programming},
  author = {Alfonso Cevallos and Friedrich Eisenbrand and Rico Zenklusen},
  year = {2016},
  doi = {10.4230/LIPIcs.SoCG.2016.26},
  url = {http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.26},
  researchr = {https://researchr.org/publication/CevallosEZ16},
  cites = {0},
  citedby = {0},
  booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA},
  editor = {Sándor P. Fekete and Anna Lubiw},
  volume = {51},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-009-5},
}