Strong Steiner Tree Approximations in Practice
| DC Element | Wert | Sprache |
|---|---|---|
| dc.contributor.author | Beyer, Stephan | |
| dc.contributor.author | Chimani, Markus | |
| dc.date.accessioned | 2022-04-19T14:04:17Z | - |
| dc.date.available | 2022-04-19T14:04:17Z | - |
| dc.date.issued | 2014 | |
| dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/52686 | - |
| dc.relation.ispartof | arXiv: Data Structures and Algorithms | |
| dc.subject | Computer science | |
| dc.subject | Tree (set theory) | |
| dc.subject | Spanning tree | |
| dc.subject | Minimum spanning tree | |
| dc.subject | Discrete mathematics | |
| dc.subject | k-minimum spanning tree | |
| dc.subject | Mathematics | |
| dc.subject | Steiner system | |
| dc.subject | Steiner tree problem | |
| dc.subject | Combinatorics | |
| dc.subject | Approximation algorithm | |
| dc.title | Strong Steiner Tree Approximations in Practice | |
| dc.type | journal article | |
| dc.identifier.url | https://arxiv.org/pdf/1409.8318.pdf | |
| dc.identifier.external | https://openalex.org/W1663464721 | |
| dcterms.oaStatus | true | |
| local.import.sourcefile | openalex_uos_20220409.ris | |
| crisitem.author.orcid | 0000-0002-4681-5550 | - |
| crisitem.author.netid | ChMa572 | - |
