Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
We present a new method of solving graph problems related to VERTEX COVER by enumerating and expanding appropriate sets of nodes. As an application, we obtain dramatically improved runtime bounds for two variants of the VERTEX COVER problem: In the case of CONNECTED VERTEX COVER, we take the upper bound from O *(6 k ) to O *(3.2361 k ) without large hidden factors. For TREE COVER, we show exactly the same complexity, improving vastly over the previous bound of O *((2k) k ). In the process, faster algorithms for solving subclasses of the Steiner tree problem on graphs are investigated.
KeywordsTree Cover Steiner Tree Vertex Cover Graph Class Steiner Tree Problem
Unable to display preview. Download preview PDF.
- 4.Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, School of CTI, DePaul University (2005)Google Scholar