Browsing by Subject POLYNOMIAL APPROXIMATION
Showing results 1 to 11 of 11
| Issue Date | Title | Author(s) |
| 2015 | Algebraic synchronization criterion and computing reset words | Berlinkov, M.; SzykuŁa, M. |
| 2023 | Approximation Schemes for Capacity Vehicle Routing Problems: A Survey | Chen, Y. |
| 2022 | Binary Completely Reachable Automata | Casas, D.; Volkov, M. V. |
| 2024 | Determining Thresholds for Optimal Adaptive Discrete Cosine Transformation | Khanov, A.; Shulzhenko, A.; Voroshilova, A.; Zubarev, A.; Karimov, T.; Fahmi, S. |
| 2020 | Identities of the kauffman monoid K4 and of the Jones Monoid J4 | Kitov, N. V.; Volkov, M. V. |
| 2019 | Linear Time Maximum Segmentation Problems in Column Stream Model | Cazaux, B.; Kosolobov, D.; Mäkinen, V.; Norri, T. |
| 2014 | On two algorithmic problems about synchronizing automata (Short Paper) | Berlinkov, M. V. |
| 2016 | Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension | Khachay, M.; Neznakhina, K. |
| 2016 | Synchronizing automata over nested words | Chistikov, D.; Martyugin, P.; Shirmohammadi, M. |
| 2017 | Threshold-coloring and unit-cube contact representation of planar graphs | Alam, M. J.; Chaplick, S.; Fijavž, G.; Kaufmann, M.; Kobourov, S. G.; Pupyrev, S.; Toeniskoetter, J. |
| 2019 | Towards an efficient approximability for the Euclidean capacitated vehicle routing problem with time windows and multiple depots | Khachay, M.; Ogorodnikov, Y. |
