DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Eunjung | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.contributor.author | Paul, Christophe | ko |
dc.contributor.author | Sau, Ignasi | ko |
dc.contributor.author | Thilikos, Dimitrios M. | ko |
dc.date.accessioned | 2023-11-13T07:01:12Z | - |
dc.date.available | 2023-11-13T07:01:12Z | - |
dc.date.created | 2023-11-13 | - |
dc.date.issued | 2015-09 | - |
dc.identifier.citation | 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, pp.35 - 46 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/314525 | - |
dc.description.abstract | The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47–66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input n-vertex graph G and an integer w, our algorithm either confirms that the tree-cut width of G is more than w or returns a tree-cut decomposition of G certifying that its tree-cut width is at most 2w, in time 2O(w2 log w) ・ n2. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known. | - |
dc.language | English | - |
dc.publisher | Springer Verlag | - |
dc.title | An FPT 2-approximation for tree-cut decomposition | - |
dc.type | Conference | - |
dc.identifier.wosid | 000374051900004 | - |
dc.identifier.scopusid | 2-s2.0-84956644549 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 35 | - |
dc.citation.endingpage | 46 | - |
dc.citation.publicationname | 13th International Workshop on Approximation and Online Algorithms, WAOA 2015 | - |
dc.identifier.conferencecountry | GR | - |
dc.identifier.conferencelocation | Patras | - |
dc.identifier.doi | 10.1007/978-3-319-28684-6_4 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Kim, Eunjung | - |
dc.contributor.nonIdAuthor | Paul, Christophe | - |
dc.contributor.nonIdAuthor | Sau, Ignasi | - |
dc.contributor.nonIdAuthor | Thilikos, Dimitrios M. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.