An exact polynomial algorithm for the outerplanar facility location problem with improved time complexity

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаярецензирование

Аннотация

The Unbounded Facility Location Problem on outerplanar graphs is considered. The algorithm with time complexity O(nm3) was known for solving this problem, where n is the number of vertices, m is the number of possible plant locations. Using some properties of maximal outerplanar graphs (binary 2-trees) and the existence of an optimal solution with a family of centrally-connected service areas, the recurrence relations are obtained allowing to design an algorithm which can solve the problem in O(nm2.5) time.

Язык оригиналаанглийский
Название основной публикацииAnalysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers
РедакторыWMP VanDerAalst, DI Ignatov, M Khachay, SO Kuznetsov, Lempitsky, IA Lomazova, N Loukachevitch, A Napoli, A Panchenko, PM Pardalos, AV Savchenko, S Wasserman
ИздательSpringer-Verlag GmbH and Co. KG
Страницы295-303
Число страниц9
ISBN (печатное издание)9783319730127
DOI
СостояниеОпубликовано - 1 янв 2018
Событие6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017 - Moscow, Российская Федерация
Продолжительность: 27 июл 201729 июл 2017

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том10716 LNCS
ISSN (печатное издание)0302-9743
ISSN (электронное издание)1611-3349

Конференция

Конференция6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017
СтранаРоссийская Федерация
ГородMoscow
Период27.07.201729.07.2017

Fingerprint Подробные сведения о темах исследования «An exact polynomial algorithm for the outerplanar facility location problem with improved time complexity». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать

    Gimadi, E. (2018). An exact polynomial algorithm for the outerplanar facility location problem with improved time complexity. В WMP. VanDerAalst, DI. Ignatov, M. Khachay, SO. Kuznetsov, Lempitsky, IA. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, PM. Pardalos, AV. Savchenko, & S. Wasserman (Ред.), Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers (стр. 295-303). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10716 LNCS). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-319-73013-4_27