Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees

Autor(en): Chimani, Markus 
Spoerhase, Joachim
Stichwörter: Computer science; Discrete mathematics; Mathematics; Steiner tree problem; Combinatorics; Upper and lower bounds; Bounded function
Erscheinungsdatum: 2014
Journal: arXiv: Data Structures and Algorithms
Externe URL: https://arxiv.org/pdf/1409.6551.pdf

Show full item record

Page view(s)

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

Google ScholarTM

Check