How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs
Συγγραφείς:	Ageev, Alexander^Aff22, Gimadi, Edward^{Aff22, Aff23}, Shtepa, Alexandr^Aff23
Συνεισφορές:	Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Burnaev, Evgeny, editor^Aff7, Ignatov, Dmitry I., editor^Aff8, Ivanov, Sergei, editor^Aff9, Khachay, Michael, editor^Aff10, Koltsova, Olessia, editor^Aff11, Kutuzov, Andrei, editor^Aff12, Kuznetsov, Sergei O., editor^Aff13, Loukachevitch, Natalia, editor^Aff14, Napoli, Amedeo, editor^Aff15, Panchenko, Alexander, editor^Aff16, Pardalos, Panos M., editor^Aff17, Saramäki, Jari, editor^Aff18, Savchenko, Andrey V., editor^Aff19, Tsymbalov, Evgenii, editor^Aff20, Tutubalina, Elena, editor^Aff21
Πηγή:	Analysis of Images, Social Networks and Texts : 10th International Conference, AIST 2021, Tbilisi, Georgia, December 16–18, 2021, Revised Selected Papers. 13217:303-314
Βάση Δεδομένων:	Springer Nature eBooks

Περιγραφή
ISBN:	9783031164996 9783031165009
DOI:	10.1007/978-3-031-16500-9_25