Optimal Discretization is Fixed-parameter Tractable

Stefan Kratsch, Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge

Open source

DOI
10.1137/1.9781611976465.103
Published
2021-01
Container
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
Publisher
Society for Industrial and Applied Mathematics
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1137/1.9781611976465.103,
  title = {Optimal Discretization is Fixed-parameter Tractable},
  author = {Stefan Kratsch and Tomáš Masařík and Irene Muzi and Marcin Pilipczuk and Manuel Sorge},
  year = {2021},
  journal = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)},
  doi = {10.1137/1.9781611976465.103},
  url = {https://doi.org/10.1137/1.9781611976465.103}
}

RIS

TY  - JOUR
TI  - Optimal Discretization is Fixed-parameter Tractable
AU  - Stefan Kratsch
AU  - Tomáš Masařík
AU  - Irene Muzi
AU  - Marcin Pilipczuk
AU  - Manuel Sorge
PY  - 2021
JO  - Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
DO  - 10.1137/1.9781611976465.103
UR  - https://doi.org/10.1137/1.9781611976465.103
ER  - 

APA

Kratsch, S., Masařík, T., Muzi, I., Pilipczuk, M., & Sorge, M. (2021). Optimal Discretization is Fixed-parameter Tractable. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). https://doi.org/10.1137/1.9781611976465.103

Source records