Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An approximation algorithm for the Steiner connectivity problem

From MaRDI portal
Publication:4686669
Jump to:navigation, search

DOI10.1002/net.21809zbMath1396.90015OpenAlexW2793431637MaRDI QIDQ4686669

Marika Karbstein, Ralf Borndörfer

Publication date: 4 October 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21809


zbMATH Keywords

hypergraphSteiner treeprimal-dual approximationdegree property


Mathematics Subject Classification ID

Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)





This page was built for publication: An approximation algorithm for the Steiner connectivity problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4686669&oldid=18910376"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 18:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki