Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A c(k)n 5-APPROXIMATION ALGORITHM FOR TREEWIDTH

Author:
Bodlaender, Hans L.  Drange, Pal Gronas  Dregi, Markus S.  Fomin, Fedor V.  Lokshtanov, Daniel  Pilipczuk, Micha L.  


Journal:
SIAM JOURNAL ON COMPUTING


Issue Date:
2016


Abstract(summary):

We give an algorithm that for an input n-vertex graph G and integer k > 0, in time 2(O(k))n, either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of width at most 5k + 4. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single exponential in k and linear in n. Treewidth-based computations are subroutines of numerous algorithms. Our algorithm can be used to speed up many such algorithms to work in time which is single exponential in the treewidth and linear in the input size.


Page:
317---378


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads