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

DC FieldValueLanguage
dc.contributor.authorChimani, Markus
dc.contributor.authorSpoerhase, Joachim
dc.date.accessioned2022-04-19T14:04:17Z-
dc.date.available2022-04-19T14:04:17Z-
dc.date.issued2014
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/52687-
dc.relation.ispartofarXiv: Data Structures and Algorithms
dc.subjectComputer science
dc.subjectDiscrete mathematics
dc.subjectMathematics
dc.subjectSteiner tree problem
dc.subjectCombinatorics
dc.subjectUpper and lower bounds
dc.subjectBounded function
dc.titleNetwork Design Problems with Bounded Distances via Shallow-Light Steiner Trees
dc.typejournal article
dc.identifier.urlhttps://arxiv.org/pdf/1409.6551.pdf
dc.identifier.externalhttps://openalex.org/W1558641606
dcterms.oaStatustrue
local.import.sourcefileopenalex_uos_20220409.ris
crisitem.author.orcid0000-0002-4681-5550-
crisitem.author.netidChMa572-
Show simple item record

Page view(s)

2
Last Week
1
Last month
0
checked on May 19, 2024

Google ScholarTM

Check