Colored Non-crossing Euclidean Steiner Forest

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

doi:10.1007/978-3-662-48971-0_37

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Colored Non-crossing Euclidean Steiner Forest

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., & Wolff, A. (2015). Colored Non-crossing Euclidean Steiner Forest. In K. Elbassioni, & K. Makino (Eds.), Algorithms and Computation (pp. 429-441). Berlin: Springer. doi:10.1007/978-3-662-48971-0_37.

Cite as: https://hdl.handle.net/21.11116/0000-0000-B559-0

Abstract

There is no abstract available