Search
Skip to Search Results- 1Arndt, D.
- 1Atwood, Gordon Harold.
- 1Berjanskii, M.
- 1Choi, Dong-Koo.
- 1Cockcroft, Daniel
- 1Domzy, Bart Courtney
- 35Graduate and Postdoctoral Studies (GPS), Faculty of
- 35Graduate and Postdoctoral Studies (GPS), Faculty of /Theses and Dissertations
- 3Computing Science, Department of
- 3Computing Science, Department of/Technical Reports (Computing Science)
- 1Biological Sciences, Department of
- 1Biological Sciences, Department of/Journal Articles (Biological Sciences)
-
Algorithmic Awareness Among Computing Science Students: Exploring Perspectives on Responsible Design and Use of Social Media
DownloadFall 2022
Computational literacy and awareness have emerged as significant public and academic concerns. Implementing robust algorithm systems on social communication platforms may have positive and negative consequences on all age groups in society, particularly on the most frequent users, young adults....
-
1998
Technical report TR98-06. In this paper, we examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). All of these graph classes admit efficient approximation algorithms which are based on exact or...
-
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...