![NP-complete problems / Combinatorial optimization / Dynamic programming / Mathematical optimization / Operations research / Optimal control / Connectivity / Tree decomposition / Parameterized complexity / Theoretical computer science / Graph theory / Mathematics NP-complete problems / Combinatorial optimization / Dynamic programming / Mathematical optimization / Operations research / Optimal control / Connectivity / Tree decomposition / Parameterized complexity / Theoretical computer science / Graph theory / Mathematics](https://www.pdfsearch.io/img/75844020b18dbcedc0e3fb2dc46be96c.jpg) Date: 2014-03-05 14:35:59NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics | | Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class ofAdd to Reading ListSource URL: www.cs.technion.ac.ilDownload Document from Source Website File Size: 539,83 KBShare Document on Facebook
|