---
_id: '20888'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
- first_name: Kathrin
  full_name: Bujna, Kathrin
  last_name: Bujna
citation:
  ama: Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means.
    <i>ACM Transactions on Algorithms</i>. 2020;16(4):1-25. doi:<a href="https://doi.org/10.1145/3409385">10.1145/3409385</a>
  apa: Blömer, J., Brauer, S., &#38; Bujna, K. (2020). A Complexity Theoretical Study
    of Fuzzy K-Means. <i>ACM Transactions on Algorithms</i>, <i>16</i>(4), 1–25. <a
    href="https://doi.org/10.1145/3409385">https://doi.org/10.1145/3409385</a>
  bibtex: '@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study
    of Fuzzy K-Means}, volume={16}, DOI={<a href="https://doi.org/10.1145/3409385">10.1145/3409385</a>},
    number={4}, journal={ACM Transactions on Algorithms}, author={Blömer, Johannes
    and Brauer, Sascha and Bujna, Kathrin}, year={2020}, pages={1–25} }'
  chicago: 'Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical
    Study of Fuzzy K-Means.” <i>ACM Transactions on Algorithms</i> 16, no. 4 (2020):
    1–25. <a href="https://doi.org/10.1145/3409385">https://doi.org/10.1145/3409385</a>.'
  ieee: J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy
    K-Means,” <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, pp. 1–25, 2020.
  mla: Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.”
    <i>ACM Transactions on Algorithms</i>, vol. 16, no. 4, 2020, pp. 1–25, doi:<a
    href="https://doi.org/10.1145/3409385">10.1145/3409385</a>.
  short: J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020)
    1–25.
date_created: 2021-01-08T08:51:42Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '64'
doi: 10.1145/3409385
intvolume: '        16'
issue: '4'
language:
- iso: eng
page: 1-25
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: ACM Transactions on Algorithms
publication_identifier:
  issn:
  - 1549-6325
  - 1549-6333
publication_status: published
status: public
title: A Complexity Theoretical Study of Fuzzy K-Means
type: journal_article
user_id: '13291'
volume: 16
year: '2020'
...
---
_id: '10790'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
- first_name: Kathrin
  full_name: Bujna, Kathrin
  last_name: Bujna
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
citation:
  ama: Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM
    algorithms? A non-asymptotic analysis for mixture models. <i>Advances in Data
    Analysis and Classification</i>. 2020;14:147–173. doi:<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>
  apa: Blömer, J., Brauer, S., Bujna, K., &#38; Kuntze, D. (2020). How well do SEM
    algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models.
    <i>Advances in Data Analysis and Classification</i>, <i>14</i>, 147–173. <a href="https://doi.org/10.1007/s11634-019-00366-7">https://doi.org/10.1007/s11634-019-00366-7</a>
  bibtex: '@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms
    imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14},
    DOI={<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>},
    journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes
    and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173}
    }'
  chicago: 'Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How
    Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture
    Models.” <i>Advances in Data Analysis and Classification</i> 14 (2020): 147–173.
    <a href="https://doi.org/10.1007/s11634-019-00366-7">https://doi.org/10.1007/s11634-019-00366-7</a>.'
  ieee: J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms
    imitate EM algorithms? A non-asymptotic analysis for mixture models,” <i>Advances
    in Data Analysis and Classification</i>, vol. 14, pp. 147–173, 2020.
  mla: Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms?
    A Non-Asymptotic Analysis for Mixture Models.” <i>Advances in Data Analysis and
    Classification</i>, vol. 14, 2020, pp. 147–173, doi:<a href="https://doi.org/10.1007/s11634-019-00366-7">10.1007/s11634-019-00366-7</a>.
  short: J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and
    Classification 14 (2020) 147–173.
date_created: 2019-07-11T08:08:25Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '64'
doi: 10.1007/s11634-019-00366-7
intvolume: '        14'
language:
- iso: eng
page: 147–173
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Advances in Data Analysis and Classification
publication_identifier:
  issn:
  - 1862-5347
  - 1862-5355
publication_status: published
status: public
title: How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis
  for mixture models
type: journal_article
user_id: '13291'
volume: 14
year: '2020'
...
---
_id: '2916'
author:
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
citation:
  ama: Brauer S. Complexity of single-swap heuristics for metric facility location
    and related problems. <i>Theoretical Computer Science</i>. 2019;754:88-106. doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>
  apa: Brauer, S. (2019). Complexity of single-swap heuristics for metric facility
    location and related problems. <i>Theoretical Computer Science</i>, <i>754</i>,
    88–106. <a href="https://doi.org/10.1016/j.tcs.2018.04.048">https://doi.org/10.1016/j.tcs.2018.04.048</a>
  bibtex: '@article{Brauer_2019, title={Complexity of single-swap heuristics for metric
    facility location and related problems}, volume={754}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer,
    Sascha}, year={2019}, pages={88–106} }'
  chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
    Location and Related Problems.” <i>Theoretical Computer Science</i> 754 (2019):
    88–106. <a href="https://doi.org/10.1016/j.tcs.2018.04.048">https://doi.org/10.1016/j.tcs.2018.04.048</a>.'
  ieee: S. Brauer, “Complexity of single-swap heuristics for metric facility location
    and related problems,” <i>Theoretical Computer Science</i>, vol. 754, pp. 88–106,
    2019.
  mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
    and Related Problems.” <i>Theoretical Computer Science</i>, vol. 754, Elsevier,
    2019, pp. 88–106, doi:<a href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>.
  short: S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
date_created: 2018-05-25T11:10:36Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2018.04.048
intvolume: '       754'
language:
- iso: eng
page: 88-106
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier
status: public
title: Complexity of single-swap heuristics for metric facility location and related
  problems
type: journal_article
user_id: '13291'
volume: 754
year: '2019'
...
---
_id: '13679'
author:
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
citation:
  ama: Brauer S. <i>Classification and Approximation of Geometric Location Problems</i>.
    Paderborn; 2019. doi:<a href="https://doi.org/10.17619/UNIPB/1-816">10.17619/UNIPB/1-816</a>
  apa: Brauer, S. (2019). <i>Classification and Approximation of Geometric Location
    Problems</i>. Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-816">https://doi.org/10.17619/UNIPB/1-816</a>
  bibtex: '@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation
    of Geometric Location Problems}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-816">10.17619/UNIPB/1-816</a>},
    author={Brauer, Sascha}, year={2019} }'
  chicago: Brauer, Sascha. <i>Classification and Approximation of Geometric Location
    Problems</i>. Paderborn, 2019. <a href="https://doi.org/10.17619/UNIPB/1-816">https://doi.org/10.17619/UNIPB/1-816</a>.
  ieee: S. Brauer, <i>Classification and Approximation of Geometric Location Problems</i>.
    Paderborn, 2019.
  mla: Brauer, Sascha. <i>Classification and Approximation of Geometric Location Problems</i>.
    2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-816">10.17619/UNIPB/1-816</a>.
  short: S. Brauer, Classification and Approximation of Geometric Location Problems,
    Paderborn, 2019.
date_created: 2019-10-09T10:00:53Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-816
language:
- iso: eng
place: Paderborn
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Classification and Approximation of Geometric Location Problems
type: dissertation
user_id: '13291'
year: '2019'
...
---
_id: '4344'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
- first_name: Kathrin
  full_name: Bujna, Kathrin
  last_name: Bujna
citation:
  ama: 'Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications.
    In: <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>.
    Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>'
  apa: 'Blömer, J., Brauer, S., &#38; Bujna, K. (2018). Coresets for Fuzzy K-Means
    with Applications. In <i>29th International Symposium on Algorithms and Computation 
    (ISAAC 2018)</i> (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik. <a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>'
  bibtex: '@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means
    with Applications}, DOI={<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>},
    booktitle={29th International Symposium on Algorithms and Computation  (ISAAC
    2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer,
    Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12}
    }'
  chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy
    K-Means with Applications.” In <i>29th International Symposium on Algorithms and
    Computation  (ISAAC 2018)</i>, 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik, 2018. <a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">https://doi.org/10.4230/LIPIcs.ISAAC.2018.46</a>.
  ieee: J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,”
    in <i>29th International Symposium on Algorithms and Computation  (ISAAC 2018)</i>,
    Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
  mla: Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” <i>29th
    International Symposium on Algorithms and Computation  (ISAAC 2018)</i>, Schloss
    Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:<a href="https://doi.org/10.4230/LIPIcs.ISAAC.2018.46">10.4230/LIPIcs.ISAAC.2018.46</a>.
  short: 'J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms
    and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
    2018, pp. 46:1--46:12.'
conference:
  end_date: 2018-12-19
  location: Jiaoxi, Yilan County, Taiwan
  name: 29th International Symposium on Algorithms and Computation (ISAAC)
  start_date: 2018-12-17
date_created: 2018-09-03T08:04:19Z
date_updated: 2022-01-06T07:00:57Z
department:
- _id: '64'
doi: 10.4230/LIPIcs.ISAAC.2018.46
language:
- iso: eng
page: 46:1--46:12
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: 29th International Symposium on Algorithms and Computation  (ISAAC 2018)
publication_identifier:
  isbn:
  - 978-3-95977-094-1
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
status: public
title: Coresets for Fuzzy K-Means with Applications
type: conference
user_id: '13291'
year: '2018'
...