Exact and approximation algorithms for two combinatorial optimization problems
Loading...
Date
Author
Institution
http://id.loc.gov/authorities/names/n79058482
Degree Level
Master's
Degree
Master of Science
Department
Department of Computing Science
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
In this thesis, we present our work on two combinatorial optimization problems. The first problem is the Bandpass problem, and we designed a linear time exact algorithm for the 3-column case. The other work is on the Complementary Maximal Strip Recovery problem, for which we designed a 3-approximation algorithm.
Item Type
http://purl.org/coar/resource_type/c_46ec
Alternative
License
Other License Text / Link
This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
Language
en