Search
Skip to Search Results- 1Atwood, Gordon Harold.
- 1Choi, Dong-Koo.
- 1Gertsberg, Vladimir.
- 1Henderson, Philip
- 1Hyatt-Denesik, Dylan V
- 1Khakpash, Saber
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Fall 2015
In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given a graph and a parameter k, and has to partition the vertices in the graph into k clusters to minimize the sum of pairwise distances...
-
Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors
DownloadFall 2013
In this thesis we present approximation algorithms for some multi-processor task scheduling problems. In a scheduling problem, there is a set of processors P that can be used to process a set of tasks T and the goal is to find a feasible scheduling of the tasks on the processors, while optimizing...
-
Spring 2023
In this thesis, we present Approximation Schemes for the Min Sum k Clustering problem on a number of classes of graph metrics. In Min Sum k Clustering problem introduced by Sahni and Gonzalez [22] in 1976, given a graph G(V, E) with metric edge costs and parameter k, we are asked to partition V...
-
Estimating Fine-Grained Mobile Application Energy Use based on Run-Time Software Measured Features
DownloadFall 2020
Inefficient mobile software kills battery life. Yet, developers lack the tools necessary to detect and solve energy bugs in software. In addition, developers are usually tasked with the creation of software features and triaging existing bugs. This means that most developers do not have the time...
-
Spring 2023
Pathfinding has been an interesting research area throughout the years. Heuristic search algorithms are used to find a path with the minimum length between a start and a goal in a graph, which has applications in GPS navigation and video games. There are different ways to create a heuristic for...