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

Approximating Steiner trees in graphs with restricted weights

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

DOI<283::AID-NET8>3.0.CO;2-9 10.1002/(SICI)1097-0037(199807)31:4<283::AID-NET8>3.0.CO;2-9zbMath0990.05032OpenAlexW2006100795MaRDI QIDQ4540056

Magnús M. Halldórsson, Yoji Kajitani, Shuichi Ueno, Hiroshi Nakao

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<283::aid-net8>3.0.co;2-9


zbMATH Keywords

weightsalgorithmsSteiner tree


Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)


Related Items (1)

Steiner tree reoptimization in graphs with sharpened triangle inequality




This page was built for publication: Approximating Steiner trees in graphs with restricted weights

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4540056&oldid=18663343"
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 11:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki