An estimate of the objective function optimum for the network Steiner problem

An estimate of the objective function optimum for the network Steiner problem

A complete weighted graph, (Formula presented.) , is considered. Let (Formula presented.) be some subset of vertices and, by definition, a Steiner tree is any tree in the graph G such that the set of the tree vertices includes set (Formula presented.). The Steiner tree problem consists of constructi...

Full description

Saved in:
Bibliographic Details
Main Authors: Kirzhner, V., Volkovich, Z., Ravve, E., Weber, G. W.
Format: Article
Published: Springer New York LLC 2016
Subjects:
QA Mathematics
Online Access:http://eprints.utm.my/id/eprint/73854/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia

Internet

http://eprints.utm.my/id/eprint/73854/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0

Similar Items