Geodesic
Efficient computation of all tolerances in the sparse maxmin path problem
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 79 (2024) no. 5, pp. 928-930 
K. V. Kaymakov; D. S. Malyshev. Efficient computation of all tolerances in the sparse maxmin path problem. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 79 (2024) no. 5, pp. 928-930. http://geodesic.mathdoc.fr/item/RM_2024_79_5_a6/
@article{RM_2024_79_5_a6,
     author = {K. V. Kaymakov and D. S. Malyshev},
     title = {Efficient computation of all tolerances in the sparse maxmin path problem},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {928--930},
     year = {2024},
     volume = {79},
     number = {5},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2024_79_5_a6/}
}
TY  - JOUR
AU  - K. V. Kaymakov
AU  - D. S. Malyshev
TI  - Efficient computation of all tolerances in the sparse maxmin path problem
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2024
SP  - 928
EP  - 930
VL  - 79
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/RM_2024_79_5_a6/
LA  - en
ID  - RM_2024_79_5_a6
ER  - 
%0 Journal Article
%A K. V. Kaymakov
%A D. S. Malyshev
%T Efficient computation of all tolerances in the sparse maxmin path problem
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2024
%P 928-930
%V 79
%N 5
%U http://geodesic.mathdoc.fr/item/RM_2024_79_5_a6/
%G en
%F RM_2024_79_5_a6

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] M. Turkensteen, D. Malyshev, B. Goldengorin, and P. M. Pardalos, J. Global Optim., 68:3 (2017), 601–622 | DOI | MR | Zbl

[2] M. Turkensteen and G. Jäger, Theoret. Comput. Sci., 937 (2022), 1–21 | DOI | MR | Zbl

[3] R. Ramaswamy, J. B. Orlin, and N. Chakravarty, Math. Program., 102:2 (A) (2005), 355–369 | DOI | MR | Zbl

[4] J. Edmonds and R. M. Karp, J. ACM, 19:2 (1972), 248–264 | DOI | Zbl

[5] G. Baier, E. Köhler, and M. Skutella, Algorithms–ESA 2002, Lecture Notes in Comput. Sci., 2461, Springer-Verlag, Berlin, 2002, 101–113 | DOI | MR | Zbl

[6] K. V. Kaymakov and D. S. Malyshev, Optim. Lett., 18:5 (2024), 1273–1283 | DOI | MR | Zbl

[7] B. Dixon, M. Rauch, and R. E. Tarjan, SIAM J. Comput., 21:6 (1992), 1184–1192 | DOI | MR | Zbl

[8] J. Fischer and V. Heun, Combinatorial pattern matching, Lecture Notes in Comput. Sci., 4009, Springer-Verlag, Berlin, 2006, 36–48 | DOI | MR | Zbl

[9] P. M. Camerini, Inform. Process. Lett., 7:1 (1978), 10–14 | DOI | MR | Zbl