Return to search

Exact and approximation algorithms for two combinatorial optimization problems

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.

Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.10048/1827
Date06 1900
CreatorsLi, Zhong
ContributorsLin, Guohui (Computing Science), Goebel, Randy (Computing Science), Hu, Yu (Electrical and Computer Engineering)
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
Languageen_US
Detected LanguageEnglish
TypeThesis
Format523704 bytes, application/pdf
RelationStudent, Zhong Li (2010). http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-514BPP0-2&_user=1067472&_coverDate=02%2F04%2F2011&_rdoc=1&_fmt=high&_orig=gateway&_origin=gateway&_sort=d&_docanchor=&view=c&_searchStrId=1670560849&_rerunOrigin=google&_acct=C000051251&_version=1&_urlVersion=0&_userid=1067472&md5=f2b41d0e2b4156daed25247afbcb6ec3&searchtype=a, Student, Zhong Li (2010). http://www.springerlink.com/content/a65161570331ltr1/

Page generated in 0.002 seconds