Approximation of Computational Cost: A Review of Algorithm Design and Analysis

$$ \mathbf{\text{Wonjun Park}} \\ \text{Computer Science} \\ \text{University of Texas at Arlington} \\ \text{Arlington, TX, USA} \\ \text{wxp7177@mavs.uta.edu} \\ $$ Abstract
This is a sample abstract $$ \mathbf{\text{Acronym and Abbreviation}} \\ \begin{array}{|c|c|} \hline \text{Binary Search Tree (BST)} & \text{Minimum Spanning Tree (MST)} \\ \hline \text{Single Source Single Destination (SSSD)} & \text{Single Source Multiple Destination (SSMD)} \\ \hline \text{Multiple Source Single Destination (MSSD)} & \text{Multiple Source Multiple Destination (MSMD)} \\ \hline \text{} & \text{} \\ \hline \end{array} $$ Keywords
Minimum Spanning Tree: A tree that connects all the vertices in a graph with the minimum possible total edge weight. The tree has $n-1$ edges where $n$ is the number of vertices in the graph.

Lorem ipsum odor amet, consectetuer adipiscing elit. Bibendum ad ligula nisi fringilla taciti malesuada. Ridiculus vestibulum non vulputate ipsum ultrices turpis senectus. Magna auctor ultricies ante habitant scelerisque dolor. Tristique iaculis egestas ornare; vel in dis. Dictum justo scelerisque cras diam fusce mauris tincidunt fermentum. Vivamus venenatis eros ad ipsum ut erat. Fames tempor dis luctus, nec inceptos amet.

Mi etiam torquent ad arcu ad? Adipiscing varius cubilia id, urna turpis ante. Suscipit metus aptent pellentesque congue sociosqu nulla varius semper. Et semper feugiat eu sapien ante placerat netus natoque. Curabitur metus nostra vel pulvinar consequat sociosqu nunc proin. Cras taciti cubilia vehicula litora ultrices tempor nunc malesuada augue. Auctor turpis donec hendrerit ultrices ut; faucibus sagittis scelerisque adipiscing.

Nullam sodales blandit ac quisque ultrices cubilia. Pharetra vivamus lectus aptent eros; congue interdum. Luctus magnis consectetur commodo, turpis nisl aptent. Sodales fames class torquent sapien finibus nostra mollis. Neque in aenean cras accumsan litora. Leo maximus sem dignissim vestibulum taciti sapien. Nulla sodales litora tempus vehicula aliquet leo.

Ultrices urna est quisque commodo commodo neque consequat. Dictum elit eleifend orci taciti senectus ultricies praesent? Adipiscing tellus ad dolor tempor etiam vel gravida dis netus. Aenean finibus proin tristique consectetur, consequat taciti. Cubilia sed proin semper nec faucibus erat posuere. Bibendum parturient hac integer fusce molestie sapien suscipit. Justo ridiculus dis gravida litora diam et curabitur aliquet. Ornare per urna laoreet adipiscing duis inceptos imperdiet. Gravida euismod vehicula facilisi luctus; dapibus urna enim magnis.

Facilisi eleifend netus donec maecenas sollicitudin. Suspendisse a elit non feugiat morbi dictum scelerisque enim. Odio ridiculus tempus viverra, curabitur enim primis. Sapien curae metus, maximus volutpat suscipit tempor tempus sed suspendisse. Blandit maximus massa bibendum integer est. Praesent per venenatis dolor nascetur mattis nisi facilisis. Nulla blandit tempus semper ac mattis rhoncus conubia. Phasellus neque cubilia mollis facilisi sodales litora fusce torquent nunc. Fusce neque tincidunt etiam pharetra cras neque at magna cras.