Strong Steiner Tree Approximations in Practice

Autor(en): Beyer, Stephan
Chimani, Markus 
Stichwörter: Computer science; Tree (set theory); Spanning tree; Minimum spanning tree; Discrete mathematics; k-minimum spanning tree; Mathematics; Steiner system; Steiner tree problem; Combinatorics; Approximation algorithm
Erscheinungsdatum: 2014
Journal: arXiv: Data Structures and Algorithms
Externe URL: https://arxiv.org/pdf/1409.8318.pdf

Show full item record

Page view(s)

2
Last Week
0
Last month
1
checked on Apr 18, 2024

Google ScholarTM

Check