On the steiner walk problem. (c2009)

LAUR Repository

Show simple item record

dc.contributor.author Maarouf, Amina
dc.date.accessioned 2011-10-24T07:28:05Z
dc.date.available 2011-10-24T07:28:05Z
dc.date.copyright 2009 en_US
dc.date.issued 2011-10-24
dc.date.submitted 2009-06-26
dc.identifier.uri http://hdl.handle.net/10725/855
dc.description Includes bibliographical references (leaves 36-37). en_US
dc.description.abstract Given a Euclidean graph G = (Y, E) with a special set of vertices, called the terminal s, the Euclidean Steiner Walk problem asks for a walk through the vertices of the graph that starts and ends at a particular point, called the center, such that every terminal vertex is visited and the total cost of the walk (or distance) is minimized. Despite its wealth of real applications, Euclidean Steiner Walk (ESW) seems to have been neglected thus far by the computing community. We show, easily, that the problem is NP-Complete and present a suite of heuristic approaches for computing efficient approximate solutions to the problem. A Graphical User Interface is also provided for users of our software and to allow developers to conduct further experimental work on the problem. en_US
dc.language.iso en en_US
dc.subject Euclidean algorithm -- Data processing en_US
dc.subject Computational complexity en_US
dc.title On the steiner walk problem. (c2009) en_US
dc.type Thesis en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 200102335 en_US
dc.author.commembers Dr. Samer Habre
dc.author.commembers Dr. Nashat Mansour
dc.author.woa OA en_US
dc.description.physdesc 1 bound copy: vii, 57 leaves; col. ill.; 31 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Faisal N. Abu KHzam
dc.identifier.doi https://doi.org/10.26756/th.2009.36 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account