Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram

Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram

Bibliographic Details
Main Author: Muhammad, Rashid Bin
Language:English
Published: Kent State University / OhioLINK 2009
Subjects:
Computer Science
Steiner tree
Voronoi diagram
range assignment
geometric routing
Online Access:http://rave.ohiolink.edu/etdc/view?acc_num=kent1259182746
id ndltd-OhioLink-oai-etd.ohiolink.edu-kent1259182746
record_format oai_dc
spelling ndltd-OhioLink-oai-etd.ohiolink.edu-kent12591827462021-08-03T05:37:07Z Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram Muhammad, Rashid Bin Computer Science Steiner tree Voronoi diagram range assignment geometric routing The thesis studied the algorithmic issues in the design and analysis of parallel and distributed geometric algorithms. In particular, the thesis presented our results on the parallel Steiner trees, the parallel Voronoi diagram, distributed range assignment, the distributed geometric routing. The thesis consists of two parts dealing with parallel and distributed techniques in geometry. In the first part, two independent problems are considered: (1) we proposed an implementable parallel algorithm for the Euclidean Steiner tree problem; (2) we proposed a Euclidean parallel Voronoi diagram algorithm. In the second part, using computational geometry techniques, we proposed algorithms for two similar problems: (3) we proposed an algorithm to setup a communication links in the emergencies by introducing relay (Steiner) nodes. Also, we present a 2-approximation to assign the transmitting ranges and finally, (4) we proposed a fully distributed algorithm to extract the connected, planar graph for wireless geometric routing. In addition, we presents geometric routing algorithm and established its lower bound. Our results of Steiner trees, Voronoi diagram and geometric routing are for, respectively, the server-client, the hypercube, and the long-distance computational models. 2009-11-30 English text Kent State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=kent1259182746 http://rave.ohiolink.edu/etdc/view?acc_num=kent1259182746 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection NDLTD
language English
sources NDLTD
topic Computer Science
Steiner tree
Voronoi diagram
range assignment
geometric routing
spellingShingle Computer Science
Steiner tree
Voronoi diagram
range assignment
geometric routing
Muhammad, Rashid Bin
Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
author Muhammad, Rashid Bin
author_facet Muhammad, Rashid Bin
author_sort Muhammad, Rashid Bin
title Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
title_short Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
title_full Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
title_fullStr Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
title_full_unstemmed Parallel and Network Algorithms and Applications for Steiner Trees and Voronoi Diagram
title_sort parallel and network algorithms and applications for steiner trees and voronoi diagram
publisher Kent State University / OhioLINK
publishDate 2009
url http://rave.ohiolink.edu/etdc/view?acc_num=kent1259182746
work_keys_str_mv AT muhammadrashidbin parallelandnetworkalgorithmsandapplicationsforsteinertreesandvoronoidiagram
_version_ 1719422576142319616

Similar Items