An efficient evolutionary algorithm for (near-) optimal Steiner tree calculation: an approach to routing of multipoint connections

Saltouros, M; Theologou, M; Angelopoulos, M; Ricudis, C

dc.contributor.author	Saltouros, M	en
dc.contributor.author	Theologou, M	en
dc.contributor.author	Angelopoulos, M	en
dc.contributor.author	Ricudis, C	en
dc.date.accessioned	2014-03-01T02:48:42Z
dc.date.available	2014-03-01T02:48:42Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34031
dc.subject	Dynamic Environment	en
dc.subject	Evolutionary Algorithm	en
dc.subject	Genetic Algorithm	en
dc.subject	Hill Climbing	en
dc.subject	Hybrid Genetic Algorithm	en
dc.subject	Multicast Routing	en
dc.subject	Search Space	en
dc.subject	steiner tree	en
dc.subject	steiner tree problem	en
dc.subject	Telecommunication Networks	en
dc.title	An efficient evolutionary algorithm for (near-) optimal Steiner tree calculation: an approach to routing of multipoint connections	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICCIMA.1999.798572	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICCIMA.1999.798572	en
heal.publicationDate	1999	en
heal.abstract	One of the most prevalent problems in modern telecommunication networks is the efficient routing of multicast connections. The formal formulation of this problem reduces to a graph-theoretical problem known as the Steiner tree problem, that is proved to be NP-complete. We present an efficient solution for the Steiner tree problem with application to multicast routing, based on a hybridized genetic	en
heal.journalName	International Conference on Computational Intelligence and Multimedia Applications	en
dc.identifier.doi	10.1109/ICCIMA.1999.798572	en