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

Novosibirsk State University's Research Portal

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-319-73013-4_27
Final published version

Edward Gimadi

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers
Editors	WMP VanDerAalst, DI Ignatov, M Khachay, SO Kuznetsov, Lempitsky, IA Lomazova, N Loukachevitch, A Napoli, A Panchenko, PM Pardalos, AV Savchenko, S Wasserman
Publisher	Springer-Verlag GmbH and Co. KG
Pages	295-303
Number of pages	9
ISBN (Print)	9783319730127
DOIs	https://doi.org/10.1007/978-3-319-73013-4_27
Publication status	Published - 1 Jan 2018
Event	6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017 - Moscow, Russian Federation Duration: 27 Jul 2017 → 29 Jul 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10716 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017
Country/Territory	Russian Federation
City	Moscow
Period	27.07.2017 → 29.07.2017

Research areas

Dynamic programming, Exact algoritm, Outerplanar graph, Time complexity, Time complexity Dynamic programming, TREES

ID: 12099489