This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results
Filter
Subject / Keyword
- 1Amortized analysis
- 1Approximation algorithms
- 1Combinatorial optimization
- 1Local search
- 1Randomized rounding
- 1String mapping
Supervisors
Author / Creator / Contributor
Year
Collections
Languages
Item type
Departments
-
Spring 2019
Many real-world problems can be formulated as combinatorial optimization problems, thus making it very important to find efficient methods to solve them, both theoretically and practically. In this thesis, we consider several NP-hard combinatorial optimization problems, consisting of some...
1 - 1 of 1