@awolff

Colored Non-Crossing Euclidean Steiner Forest

, , , , , and . Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC'15), volume 9472 of Lecture Notes in Computer Science, page 429--441. Springer-Verlag, (2015)
DOI: 10.1007/978-3-662-48971-0_37

Links and resources

Tags

community

  • @kindermann
  • @awolff
  • @fleszark
  • @dblp
  • @jspoerhase
@awolff's tags highlighted