{"paper":{"title":"Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bruno Escoffier, Edouard Bonnet, Emeric Tourniaire, Vangelis Th. Paschos","submitted_at":"2013-06-10T14:48:11Z","abstract_excerpt":"We study the parameterized complexity of a broad class of problems called \"local graph partitioning problems\" that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique \"greediness-for-parameterization\", we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its value) and \\Delta, the maximum degree of the input graph. In particular, greediness-for-parameterization improves asymptotic running times for these problems upon random separation (that is a special case of col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2217","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}