BibTeX Export for Approximation Algorithms for Continuous Clustering and Facility Location Problems

Copy to Clipboard Download

@InProceedings{chakrabarty_et_al:LIPIcs.ESA.2022.33,
  author =	{Chakrabarty, Deeparnab and Negahbani, Maryam and Sarkar, Ankita},
  title =	{{Approximation Algorithms for Continuous Clustering and Facility Location Problems}},
  booktitle =	{30th Annual European Symposium on Algorithms (ESA 2022)},
  pages =	{33:1--33:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-247-1},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{244},
  editor =	{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.33},
  URN =		{urn:nbn:de:0030-drops-169710},
  doi =		{10.4230/LIPIcs.ESA.2022.33},
  annote =	{Keywords: Approximation Algorithms, Clustering, Facility Location, Fairness, Outliers}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode