On modification of an asymptotically optimal algorithm for the maximum Euclidean traveling salesman problem › Research Explorer

Novosibirsk State University's Research Portal

On modification of an asymptotically optimal algorithm for the maximum Euclidean traveling salesman problem

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

DOI

https://doi.org/10.1007/978-3-030-11027-7_27
Final published version

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers
Publisher	Springer
Pages	283-293
Number of pages	11
ISBN (Print)	9783030110260
DOIs	https://doi.org/10.1007/978-3-030-11027-7_27
Publication status	Published - 1 Jan 2018
Event	7th International Conference on Analysis of Images, Social Networks and Texts - Moscow, Russian Federation Duration: 5 Jul 2018 → 7 Jul 2018 Conference number: 7

Publication series

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

Conference

Conference	7th International Conference on Analysis of Images, Social Networks and Texts
Abbreviated title	AIST 2018
Country/Territory	Russian Federation
City	Moscow
Period	05.07.2018 → 07.07.2018

Research areas

Asymptotically optimal algorithm, Cycle cover, Euclidean space, Maximum traveling salesman problem, Metric space, Normed space

ID: 18129369