2013/11/03 by Meirav Zehavi, Zehavi, Meirav
Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Packing Problems #cs.DS
paper · pdf · doi:10.48550/arxiv.1311.0484
Consideration for replacement: A better bound on the running time of WSP-Alg (see Section 5)
openalex publication_date 2013/11/03 · arxiv created 2013/11/16 · arxiv updated 2013/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present three deterministic parameterized algorithms for well-studied packing and matching problems, namely, Weighted q-Dimensional p-Matching ((q,p)-WDM) and Weighted q-Set p-Packing ((q,p)-WSP). More specifically, we present an O*(2.85043(q-1)p) time deterministic algorithm for (q,p)-WDM, an O*(8.04143p) time deterministic algorithm for the unweighted version of (3,p)-WDM, and an O*((0.56201⋅ 2.85043q)p) time deterministic algorithm for (q,p)-WSP. Our algorithms significantly improve the previously best known O* running times in solving (q,p)-WDM and (q,p)-WSP, and the previously best known deterministic O* running times in solving the unweighted versions of these problems. Moreover, we present kernels of size O(eqq(p-1)q) for (q,p)-WDM and (q,p)-WSP, improving the previously best known kernels of size O(q!q(p-1)q) for these problems.