Topology sensitive algorithms for large scale uncapacitated covering problem

Solving NP-hard facility location problems in wireless network planning is a common scenario. In our research, we study the Covering problem, a well known facility location problem with applications in wireless network deployment. We focus on networks with a sparse structure. First, we analyzed two heuristics of building Tree Decomposition based on vertex separator and perfect elimination order. We extended the vertex separator heuristic to improve its time performance. Second, we propose a dynamic programming algorithm based on the Tree Decomposition to solve the Covering problem optimally on the network. We developed several heuristic techniques to speed up the algorithm. Experiment results show that one variant of the dynamic programming algorithm surpasses the performance of the state of the art mathematical optimization commercial software on several occasions.

Grantor dc:publisher

Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011

Year dc:date.issued

2011

Author dc:creator

• Sabbir, Tarikul Alam Khan

Advisors dc:contributor.supervisor

• Gaur, Daya
• Benkoczi, Robert

• Combinatorial optimization
• Trees (Graph theory)
• Algorithms
• Wireless internet
• Wireless sensor networks
• Dissertations, Academic

Language dc:language.iso

en_US

Identifier

hdl:10133/3235

OAI record oai:identifier

https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F3235