Colored non-crossing Euclidean Steiner forest

Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

2 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Verlag
Страницы429-441
Число страниц13
Том9472
ISBN (печатное издание)9783662489703
DOI
СостояниеОпубликовано - 2015
Событие26th International Symposium on Algorithms and Computation, ISAAC 2015 - Nagoya, Япония
Продолжительность: 9 дек 201511 дек 2015

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

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том9472
ISSN (печатное издание)03029743
ISSN (электронное издание)16113349

Конференция

Конференция26th International Symposium on Algorithms and Computation, ISAAC 2015
СтранаЯпония
ГородNagoya
Период09/12/201511/12/2015

Отпечаток

Approximation algorithms
Euclidean
Approximation Algorithms
Steiner Ratio
K-tree
Steiner Tree Problem
Color
Approximation

Предметные области ASJC Scopus

  • Computer Science(all)
  • Theoretical Computer Science

Предметные области WoS

  • Компьютерные науки, Теория и методы

Цитировать

Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., & Wolff, A. (2015). Colored non-crossing Euclidean Steiner forest. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Том 9472, стр. 429-441). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9472). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_37
Bereg, Sergey ; Fleszar, Krzysztof ; Kindermann, Philipp ; Pupyrev, Sergey ; Spoerhase, Joachim ; Wolff, Alexander. / Colored non-crossing Euclidean Steiner forest. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9472 Springer Verlag, 2015. стр. 429-441 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fe0e1de017234d16bcb3abdd7b114ef4,
title = "Colored non-crossing Euclidean Steiner forest",
author = "Sergey Bereg and Krzysztof Fleszar and Philipp Kindermann and Sergey Pupyrev and Joachim Spoerhase and Alexander Wolff",
year = "2015",
doi = "10.1007/978-3-662-48971-0_37",
language = "English",
isbn = "9783662489703",
volume = "9472",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "429--441",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",

}

Bereg, S, Fleszar, K, Kindermann, P, Pupyrev, S, Spoerhase, J & Wolff, A 2015, Colored non-crossing Euclidean Steiner forest. в Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). том. 9472, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 9472, Springer Verlag, стр. 429-441, 26th International Symposium on Algorithms and Computation, ISAAC 2015, Nagoya, Япония, 09/12/2015. https://doi.org/10.1007/978-3-662-48971-0_37

Colored non-crossing Euclidean Steiner forest. / Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9472 Springer Verlag, 2015. стр. 429-441 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9472).

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

TY - GEN

T1 - Colored non-crossing Euclidean Steiner forest

AU - Bereg, Sergey

AU - Fleszar, Krzysztof

AU - Kindermann, Philipp

AU - Pupyrev, Sergey

AU - Spoerhase, Joachim

AU - Wolff, Alexander

PY - 2015

Y1 - 2015

UR - http://www.scopus.com/inward/record.url?scp=84952045448&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000375151300037

U2 - 10.1007/978-3-662-48971-0_37

DO - 10.1007/978-3-662-48971-0_37

M3 - Conference contribution

SN - 9783662489703

VL - 9472

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 429

EP - 441

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -

Bereg S, Fleszar K, Kindermann P, Pupyrev S, Spoerhase J, Wolff A. Colored non-crossing Euclidean Steiner forest. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9472. Springer Verlag. 2015. стр. 429-441. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-48971-0_37