Matching and Weighted P2-Packing: Algorithms and Kernels
Parameterized algorithms and kernelization algorithms are presented for the weighted P2-Packing problem, which is a generalization of the famous Graph Matching problem. The parameterized algorithms are based on the following new techniques and observations: (1) new study on structure relationship be...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 522; s. 85 - 94 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
20.02.2014
|
| Predmet: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Parameterized algorithms and kernelization algorithms are presented for the weighted P2-Packing problem, which is a generalization of the famous Graph Matching problem. The parameterized algorithms are based on the following new techniques and observations: (1) new study on structure relationship between graph matchings in general graphs and P2-packings in bipartite graphs; (2) an effective graph bi-partitioning algorithm; and (3) a polynomial-time algorithm for a constrained weighted P2-Packing problem in bipartite graphs. The kernelization algorithms are based on the following new techniques: (1) the application of graph matching in kernelization; (2) a crown reduction structure for weighted problems. These techniques lead to randomized and deterministic parameterized algorithms that significantly improve the previous best upper bounds for the problem for both weighted and unweighted versions. For the kernelization algorithm, by using a weighted version of crown reduction, a kernel of size O(k2) is presented, where k is the given parameter of the problem. |
|---|---|
| AbstractList | Parameterized algorithms and kernelization algorithms are presented for the weighted P2-Packing problem, which is a generalization of the famous Graph Matching problem. The parameterized algorithms are based on the following new techniques and observations: (1) new study on structure relationship between graph matchings in general graphs and P2-packings in bipartite graphs; (2) an effective graph bi-partitioning algorithm; and (3) a polynomial-time algorithm for a constrained weighted P2-Packing problem in bipartite graphs. The kernelization algorithms are based on the following new techniques: (1) the application of graph matching in kernelization; (2) a crown reduction structure for weighted problems. These techniques lead to randomized and deterministic parameterized algorithms that significantly improve the previous best upper bounds for the problem for both weighted and unweighted versions. For the kernelization algorithm, by using a weighted version of crown reduction, a kernel of size O(k2) is presented, where k is the given parameter of the problem. |
| Author | Chen, Jianer Feng, Qilong Wang, Jianxin |
| Author_xml | – sequence: 1 givenname: Qilong surname: Feng fullname: Feng, Qilong organization: School of Information Science and Engineering, Central South University, Changsha 410083, PR China – sequence: 2 givenname: Jianxin surname: Wang fullname: Wang, Jianxin email: jxwang@mail.csu.edu.cn organization: School of Information Science and Engineering, Central South University, Changsha 410083, PR China – sequence: 3 givenname: Jianer surname: Chen fullname: Chen, Jianer organization: School of Information Science and Engineering, Central South University, Changsha 410083, PR China |
| BookMark | eNotkM9KxDAYxIOsYHf1Abz1BVrzJU3b6GlZdBVX3IPiMeTP1za1ptAUn9-uOpeBYZiB35qswhiQkGugOVAob_p8tjFnFHgOLKcAZySBupIZY7JYkYRyWmRcVuKCrGPs6SJRlQmpX_RsOx_aVAeXfqBvuxldemTZUdvPJb9Nt0M7Tn7uvuJv5xmngEO8JOeNHiJe_fuGvD_cv-0es8Pr_mm3PWQIjM1ZY7moHdPCOt1YKBlQU-pGmsZpI4CWFoURVEpZWKkBDC-tqUxNkYERDPmG3P3tLp_47XFS0XoMFp2f0M7KjV4BVScIqlcLBHWCoICpBQL_AfrcUsw |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier B.V. |
| Copyright_xml | – notice: 2013 Elsevier B.V. |
| DBID | 6I. AAFTH |
| DOI | 10.1016/j.tcs.2013.12.011 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 94 |
| ExternalDocumentID | S0304397513009237 |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61232001; 61103033; 61173051; 71221061 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- |
| ID | FETCH-LOGICAL-e122t-fc358d2a5cdafc16210b6af9bfdab5106ce5b509994c9a11b36cb7b80e21b52e3 |
| ISSN | 0304-3975 |
| IngestDate | Fri Feb 23 02:30:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Matching Weighted P2-Packing Parameterized algorithm Kernelization |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-e122t-fc358d2a5cdafc16210b6af9bfdab5106ce5b509994c9a11b36cb7b80e21b52e3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2013.12.011 |
| PageCount | 10 |
| ParticipantIDs | elsevier_sciencedirect_doi_10_1016_j_tcs_2013_12_011 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-02-20 |
| PublicationDateYYYYMMDD | 2014-02-20 |
| PublicationDate_xml | – month: 02 year: 2014 text: 2014-02-20 day: 20 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Chen, Lu (br0030) 2008; 54 Hassin, Rubinstein (br0090) 2006; 154 Bazgan, Hassin, Monnot (br0020) 2005; 146 Hurkens, Schrijver (br0110) 1989; 2 Kann (br0120) 1994; 49 De Bontridder, Halldórsson, Lenstra, Ravi, Stougie (br0040) 2003; 98 Feng, Liu, Lu, Wang (br0060) 2009; vol. 5532 Kirkpatrick, Hell (br0140) 1983; 12 Monnot, Toulouse (br0160) 2007; vol. 4362 Wang, Ning, Feng, Chen (br0200) 2008; vol. 4978 Wang, Feng (br0190) 2008; vol. 4978 Fellows, Heggernes, Rosamond, Sloper, Telle (br0050) 2004; vol. 3353 Fernau, Raible (br0080) 2009; 18 Koutis (br0130) 2008; vol. 5125 van Leeuwen (br0150) 1990 Gabow (br0070) 1990 Hell, Kirkpatrick (br0100) 1978 Naor, Schulman, Srinivasan (br0170) 1995 Prieto, Sloper (br0180) 2006; 351 Niedermeier (br0210) March 2006 Bar-Yehuda, Halldórsson, Naor, Shachnai, Shapira (br0010) 2002 |
| References_xml | – volume: 98 start-page: 477 year: 2003 end-page: 491 ident: br0040 article-title: Approximation algorithms for the test cover problem publication-title: Math. Program., Ser. B – volume: 49 start-page: 309 year: 1994 end-page: 318 ident: br0120 article-title: Maximum bounded publication-title: Inf. Process. Lett. – volume: vol. 3353 start-page: 235 year: 2004 end-page: 244 ident: br0050 article-title: Exact algorithms for finding publication-title: Proc. 30th Workshop on Graph Theoretic Concepts in Computer Science – start-page: 182 year: 1995 end-page: 190 ident: br0170 article-title: Splitters and near-optimal derandomization publication-title: Proc. 39th Annual Symposium on Foundations of Computer Science – volume: vol. 5532 start-page: 211 year: 2009 end-page: 220 ident: br0060 article-title: Improved deterministic algorithms for weighted matching and packing problems publication-title: Proc. 6th Annual Conference on Theory and Applications of Models of Computation – volume: vol. 5125 start-page: 575 year: 2008 end-page: 586 ident: br0130 article-title: Faster algebraic algorithms for path and packing problems publication-title: Proc. 35th International Colloquium on Automata, Languages and Programming – volume: vol. 4978 start-page: 82 year: 2008 end-page: 93 ident: br0190 article-title: An publication-title: Proc. 5th Annual Conference on Theory and Applications of Models of Computation – volume: vol. 4978 start-page: 212 year: 2008 end-page: 222 ident: br0200 article-title: An improved parameterized algorithm for a generalized matching problem publication-title: Proc. 5th Annual Conference on Theory and Applications of Models of Computation – year: March 2006 ident: br0210 article-title: Invitation to Fixed Parameter Algorithms publication-title: Oxford Lect. Ser. Math. Appl. – start-page: 525 year: 1990 end-page: 631 ident: br0150 article-title: Graph algorithms publication-title: Handbook of Theoretical Computer Science, vol. A – volume: 146 start-page: 27 year: 2005 end-page: 42 ident: br0020 article-title: Approximation algorithms for some vehicle routing problems publication-title: Discrete Appl. Math. – start-page: 240 year: 1978 end-page: 245 ident: br0100 article-title: On the complexity of a generalized matching problem publication-title: Proc. 10th Annual ACM Symposium on Theory of Computing – volume: vol. 4362 start-page: 422 year: 2007 end-page: 433 ident: br0160 article-title: The publication-title: Proc. 33rd Conference on Current Trends in Theory and Practice of Computer Science – volume: 18 start-page: 319 year: 2009 end-page: 341 ident: br0080 article-title: A parameterized perspective on packing paths of length two publication-title: J. Comb. Optim. – volume: 54 start-page: 472 year: 2008 end-page: 489 ident: br0030 article-title: Improved parameterized set splitting algorithms: A probabilistic approach publication-title: Algorithmica – volume: 154 start-page: 971 year: 2006 end-page: 979 ident: br0090 article-title: An approximation algorithm for maximum triangle packing publication-title: Discrete Appl. Math. – volume: 351 start-page: 437 year: 2006 end-page: 445 ident: br0180 article-title: Looking at the stars publication-title: Theor. Comput. Sci. – volume: 12 start-page: 601 year: 1983 end-page: 609 ident: br0140 article-title: On the complexity of general graph factor problems publication-title: SIAM J. Comput. – start-page: 732 year: 2002 end-page: 741 ident: br0010 article-title: Scheduling split intervals publication-title: Proc. 13th Annual ACM–SIAM Symposium on Discrete Algorithms – start-page: 434 year: 1990 end-page: 443 ident: br0070 article-title: Data structures for weighted matching and nearest common ancestors publication-title: Proc. 1st Annual ACM–SIAM Symposium on Discrete Algorithms – volume: 2 start-page: 68 year: 1989 end-page: 72 ident: br0110 article-title: On the size of systems of sets every publication-title: SIAM J. Discrete Math. |
| SSID | ssj0000576 |
| Score | 2.1528292 |
| Snippet | Parameterized algorithms and kernelization algorithms are presented for the weighted P2-Packing problem, which is a generalization of the famous Graph Matching... |
| SourceID | elsevier |
| SourceType | Publisher |
| StartPage | 85 |
| SubjectTerms | Kernelization Matching Parameterized algorithm Weighted [formula omitted]-Packing |
| Title | Matching and Weighted P2-Packing: Algorithms and Kernels |
| URI | https://dx.doi.org/10.1016/j.tcs.2013.12.011 |
| Volume | 522 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JbtswECVaJ4fm0CULkm7QobeCgUWJItmbEaToggQu6iK-CSRNJU5dObDVwp_foTi03OaSFOhFEAgtBN_gcTjkmyHkDVPMyxlz6rjsU2BJQbWROdUq16IqjHDctsUmxPm5HI_VEMulLttyAqKu5Wqlbv4r1NAGYHvp7D3gXn8UGuAeQIcrwA7XOwF_BuR6FaWHF23kE5zKIaNDbb-jvHkwu5wvps3Vj5Ch-bNb1CGt8tpRHW0IHC1WfniL02XnPgai-DKdzXECbEPzeMgXDG81XdveSZSBQDOeCMZgA0Doxdv9LgJ2SwUTlFd-d0WFCijHLhCpFIoyFgoYR6blQYKMXCn5xqwbHrzF5yG0cH3cWJ9aPc3a0C2y859psr_6XvhO-P058FrFQ7LFBFfAdFuDj6fjT938zEXYwcZex73u9tTfXz_acFE23I7RU_IY1wvJIOD8jDxw9S55EmtxJEjNu2TnbJ1_d7lHZDSCBOBNohEknRG8SzoTaJ9BE9gn396fjk4-UKyRQV3KWEMrm3E5YZrbia5sWsAK3hS6UqaaaAN8W1jHDffLgNwqnaYmK6wRRvYdSw1nLjsgvXpeu0OSFDIrpDHWaKdhmd-H15zJFXxB-RRE6RHJ41iUaG_B7SoBrTKeFrwuYQhLP4RlykoYwuf_9toL8qgzwJek1yx-uldk2_5qpsvFa8T0N6O1W4o |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Matching+and+Weighted+P2-Packing%3A+Algorithms+and+Kernels&rft.jtitle=Theoretical+computer+science&rft.au=Feng%2C+Qilong&rft.au=Wang%2C+Jianxin&rft.au=Chen%2C+Jianer&rft.date=2014-02-20&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=522&rft.spage=85&rft.epage=94&rft_id=info:doi/10.1016%2Fj.tcs.2013.12.011&rft.externalDocID=S0304397513009237 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |