Usage
  • 55 views
  • 70 downloads

Exact and approximation algorithms for two combinatorial optimization problems

  • Author / Creator
    Li, Zhong
  • 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.

  • Subjects / Keywords
  • Graduation date
    2011-06
  • Type of Item
    Thesis
  • Degree
    Master of Science
  • DOI
    https://doi.org/10.7939/R3W367
  • License
    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
    English
  • Institution
    University of Alberta
  • Degree level
    Master's
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Lin, Guohui (Computing Science)
  • Examining committee members and their departments
    • Goebel, Randy (Computing Science)
    • Hu, Yu (Electrical and Computer Engineering)