Improved parameterized and exact algorithms for cut problems on trees
We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 607; s. 455 - 470 |
|---|---|
| Hlavní autoři: | , , , , , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2015
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen et al. that runs in time O⁎(1.619k). For the Generalized Multiway Cut on Trees problem, we show that this problem is solvable in polynomial time if the number of terminal sets is fixed; this answers an open question posed in a recent paper by Liu and Zhang. By reducing the Generalized Multiway Cut on Trees problem to the Multicut on Trees problem, our results give a parameterized algorithm that solves the Generalized Multiway Cut on Trees problem in time O⁎(ρk). |
|---|---|
| AbstractList | We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time , where is the positive root of the polynomial . This improves the current-best algorithm of Chen et al. that runs in time . For the Generalized Multiway Cut on Trees problem, we show that this problem is solvable in polynomial time if the number of terminal sets is fixed; this answers an open question posed in a recent paper by Liu and Zhang. By reducing the Generalized Multiway Cut on Trees problem to the Multicut on Trees problem, our results give a parameterized algorithm that solves the Generalized Multiway Cut on Trees problem in time . We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen et al. that runs in time O⁎(1.619k). For the Generalized Multiway Cut on Trees problem, we show that this problem is solvable in polynomial time if the number of terminal sets is fixed; this answers an open question posed in a recent paper by Liu and Zhang. By reducing the Generalized Multiway Cut on Trees problem to the Multicut on Trees problem, our results give a parameterized algorithm that solves the Generalized Multiway Cut on Trees problem in time O⁎(ρk). |
| Author | Tong, Weitian Zhang, Peng Lin, Guohui Kanj, Iyad Liu, Tian Xu, Jinhui Zhang, Fenghui Zhu, Binhai Xia, Ge Yang, Boting |
| Author_xml | – sequence: 1 givenname: Iyad surname: Kanj fullname: Kanj, Iyad email: ikanj@cs.depaul.edu organization: School of Computing, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604, USA – sequence: 2 givenname: Guohui surname: Lin fullname: Lin, Guohui email: guohui@ualberta.ca organization: Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada – sequence: 3 givenname: Tian surname: Liu fullname: Liu, Tian email: lt@pku.edu.cn organization: Key Laboratory of High Confidence Software Technologies, Ministry of Education, Institute of Software, School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China – sequence: 4 givenname: Weitian surname: Tong fullname: Tong, Weitian email: weitian@ualberta.ca organization: Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada – sequence: 5 givenname: Ge surname: Xia fullname: Xia, Ge email: xiag@lafayette.edu organization: Department of Computer Science, Lafayette College, 506 Acopian Engineering Center, Easton, PA 18042, USA – sequence: 6 givenname: Jinhui surname: Xu fullname: Xu, Jinhui email: jinhui@buffalo.edu organization: Department of Computer Science and Engineering, State University of New York at Buffalo (SUNY Buffalo), 338 Davis Hall, Buffalo, NY 14260, USA – sequence: 7 givenname: Boting surname: Yang fullname: Yang, Boting email: boting@cs.uregina.ca organization: Department of Computer Science, University of Regina, Regina, Saskatchewan S4S 0A2, Canada – sequence: 8 givenname: Fenghui surname: Zhang fullname: Zhang, Fenghui email: fhzhang@gmail.com organization: Google Kirkland, 747 6th Street South, Kirkland, WA 98033, USA – sequence: 9 givenname: Peng orcidid: 0000-0001-7265-0983 surname: Zhang fullname: Zhang, Peng email: algzhang@sdu.edu.cn organization: School of Computer Science and Technology, Shandong University, China – sequence: 10 givenname: Binhai surname: Zhu fullname: Zhu, Binhai email: bhz@cs.montana.edu organization: Department of Computer Science, Montana State University, Bozeman, MT 59717, USA |
| BookMark | eNp9kD9PwzAQxS1UJNrCB2DLyJJwjmMnFhOqyh-pEgvMlutcwFUSF9utgE-PqzIx9JbTnd7v9O7NyGR0IxJyTaGgQMXtpogmFCVQXoAogMIZmdKmlnlZympCpsCgypms-QWZhbCBVLwWU7J8Hrbe7bHNttrrASN6-5MmPbYZfmkTM92_O2_jxxCyzvnM7GKWiHWPaeHGLHrEcEnOO90HvPrrc_L2sHxdPOWrl8fnxf0qN4xBzKkA2ZjGVCixwaoSkid7WksOyNaUd0y3nRF1pTmspabScMNqBpTJVlNkbE5ujneTg88dhqgGGwz2vR7R7YKidSNKWpUCkrQ-So13IXjslLFRR-vG6LXtFQV1CE5tVApOHYJTIFQKLpH0H7n1dtD--yRzd2Qwfb-36FUwFkeDrfVoomqdPUH_ArfQiB4 |
| CitedBy_id | crossref_primary_10_1007_s10878_020_00568_2 crossref_primary_10_1016_j_tcs_2018_04_044 |
| Cites_doi | 10.1007/s10878-012-9565-9 10.1137/S0097539792225297 10.1007/BF02523685 10.1016/j.jcss.2007.06.019 10.1016/j.endm.2004.03.016 10.1006/jagm.2001.1186 10.1002/net.20081 10.1002/net.3230210106 10.1016/j.jcss.2012.03.001 10.1016/j.ejor.2003.10.037 10.1016/j.tcs.2005.10.007 10.1137/S0097539793243016 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.06.010 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 470 |
| ExternalDocumentID | 10_1016_j_tcs_2015_06_010 S0304397515005125 |
| 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 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- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-16098c8c4e9e8e44695229aa950e3b15f3adfc674a50b9a19c5c3730139da1e33 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366773600016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Sep 27 17:15:03 EDT 2025 Sat Nov 29 05:15:20 EST 2025 Tue Nov 18 20:12:44 EST 2025 Fri Feb 23 02:30:23 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Tree Multiway cut Multicut Parameterized algorithm Exact algorithm |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-16098c8c4e9e8e44695229aa950e3b15f3adfc674a50b9a19c5c3730139da1e33 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0001-7265-0983 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.06.010 |
| PQID | 1786214260 |
| PQPubID | 23500 |
| PageCount | 16 |
| ParticipantIDs | proquest_miscellaneous_1786214260 crossref_citationtrail_10_1016_j_tcs_2015_06_010 crossref_primary_10_1016_j_tcs_2015_06_010 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_06_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-01 |
| PublicationDateYYYYMMDD | 2015-11-01 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Costa, Billionnet (br0070) 2004; 17 Costa, Letocart, Roupin (br0080) 2005; 162 Marx (br0200) 2006; 351 Niedermeier (br0230) 2006 Downey, Fellows (br0110) 1999 Bousquet, Daligault, Thomassé (br0010) 2011 Bousquet, Daligault, Thomassé, Yeo (br0020) 2009 Chitnis, Hajiaghayi, Marx (br0050) 2012 Chopra, Rao (br0060) 1991; 21 Chen, Kanj, Jia (br0040) 2001; 41 Garg, Vazirani, Yannakakis (br0130) 1996; 25 Marx, Razgon (br0220) 2011 West (br0240) 1996 Garg, Vazirani, Yannakakis (br0140) 1997; 18 Chen, Fan, Kanj, Liu, Zhang (br0030) 2012; 78 Guo, Niedermeier (br0150) 2005; 46 Flüm, Grohe (br0120) 2010 Marx (br0210) 2012 Klein, Marx (br0180) 2012 Liu, Zhang (br0190) 2014; 27 Dahlhaus, Johnson, Papadimitriou, Seymour, Yannakakis (br0090) 1994; 23 Deng, Lin, Zhang (br0100) 2013 Kanj, Lin, Liu, Tong, Xia, Xu, Yang, Zhang, Zhang, Zhu (br0160) 2014 Khot, Regev (br0170) 2008; 74 Costa (10.1016/j.tcs.2015.06.010_br0070) 2004; 17 Chen (10.1016/j.tcs.2015.06.010_br0040) 2001; 41 Bousquet (10.1016/j.tcs.2015.06.010_br0010) 2011 Garg (10.1016/j.tcs.2015.06.010_br0130) 1996; 25 Kanj (10.1016/j.tcs.2015.06.010_br0160) 2014 Chitnis (10.1016/j.tcs.2015.06.010_br0050) 2012 Bousquet (10.1016/j.tcs.2015.06.010_br0020) 2009 Liu (10.1016/j.tcs.2015.06.010_br0190) 2014; 27 Downey (10.1016/j.tcs.2015.06.010_br0110) 1999 Dahlhaus (10.1016/j.tcs.2015.06.010_br0090) 1994; 23 Marx (10.1016/j.tcs.2015.06.010_br0200) 2006; 351 Klein (10.1016/j.tcs.2015.06.010_br0180) 2012 Costa (10.1016/j.tcs.2015.06.010_br0080) 2005; 162 Chen (10.1016/j.tcs.2015.06.010_br0030) 2012; 78 Khot (10.1016/j.tcs.2015.06.010_br0170) 2008; 74 West (10.1016/j.tcs.2015.06.010_br0240) 1996 Chopra (10.1016/j.tcs.2015.06.010_br0060) 1991; 21 Marx (10.1016/j.tcs.2015.06.010_br0210) 2012 Marx (10.1016/j.tcs.2015.06.010_br0220) 2011 Deng (10.1016/j.tcs.2015.06.010_br0100) 2013 Guo (10.1016/j.tcs.2015.06.010_br0150) 2005; 46 Niedermeier (10.1016/j.tcs.2015.06.010_br0230) 2006 Flüm (10.1016/j.tcs.2015.06.010_br0120) 2010 Garg (10.1016/j.tcs.2015.06.010_br0140) 1997; 18 |
| References_xml | – volume: 41 start-page: 280 year: 2001 end-page: 301 ident: br0040 article-title: Vertex cover: further observations and further improvements publication-title: J. Algorithms – volume: 17 start-page: 105 year: 2004 end-page: 109 ident: br0070 article-title: Multiway cut and integer flow problems in trees publication-title: Electron. Notes Discrete Math. – start-page: 317 year: 2013 end-page: 326 ident: br0100 article-title: Multi-multiway cut problem on graphs of bounded branch width publication-title: Proceedings of the 7th International Frontiers of Algorithmics Workshop – volume: 18 start-page: 3 year: 1997 end-page: 20 ident: br0140 article-title: Primal-dual approximation algorithms for integral flow and multicut in trees publication-title: Algorithmica – start-page: 569 year: 2012 end-page: 580 ident: br0180 article-title: Solving planar publication-title: Proceedings of the 39th International Colloquium on Automata, Languages, and Programming – start-page: 459 year: 2011 end-page: 468 ident: br0010 article-title: Multicut is FPT publication-title: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing – volume: 23 start-page: 864 year: 1994 end-page: 894 ident: br0090 article-title: The complexity of multiterminal cuts publication-title: SIAM J. Comput. – volume: 25 start-page: 235 year: 1996 end-page: 251 ident: br0130 article-title: Approximate max-flow min-(multi)cut theorems and their applications publication-title: SIAM J. Comput. – volume: 74 start-page: 335 year: 2008 end-page: 349 ident: br0170 article-title: Vertex cover might be hard to approximate to within publication-title: J. Comput. System Sci. – start-page: 469 year: 2011 end-page: 478 ident: br0220 article-title: Fixed-parameter tractability of multicut parameterized by the size of the cutset publication-title: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing – volume: 351 start-page: 394 year: 2006 end-page: 406 ident: br0200 article-title: Parameterized graph separation problems publication-title: Theoret. Comput. Sci. – volume: 21 start-page: 51 year: 1991 end-page: 89 ident: br0060 article-title: On the multiway cut polyhedron publication-title: Networks – year: 2012 ident: br0210 article-title: A tight lower bound for planar multiway cut with fixed number of terminals publication-title: Proceedings of the 39th International Colloquium on Automata, Languages, and Programming – volume: 162 start-page: 55 year: 2005 end-page: 69 ident: br0080 article-title: Minimal multicut and maximal integer multiflow: a survey publication-title: European J. Oper. Res. – volume: 46 start-page: 124 year: 2005 end-page: 135 ident: br0150 article-title: Fixed-parameter tractability and data reduction for multicut in trees publication-title: Networks – start-page: 1713 year: 2012 end-page: 1725 ident: br0050 article-title: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset publication-title: Proceedings of the 23rd Annual ACM–SIAM Symposium on Discrete Algorithms – year: 2010 ident: br0120 article-title: Parameterized Complexity Theory – start-page: 283 year: 2014 end-page: 298 ident: br0160 article-title: Algorithms for cut problems on trees publication-title: Proceedings of the 8th International Conference of Combinatorial Optimization and Applications – volume: 27 start-page: 65 year: 2014 end-page: 77 ident: br0190 article-title: On the generalized multiway cut in trees problem publication-title: J. Comb. Optim. – year: 2006 ident: br0230 article-title: Invitation to Fixed-Parameter Algorithms – start-page: 183 year: 2009 end-page: 194 ident: br0020 article-title: A polynomial kernel for multicut in trees publication-title: Proceedings of the 26th Symposium on Theoretical Aspects of Computer Science – year: 1999 ident: br0110 article-title: Parameterized Complexity – year: 1996 ident: br0240 article-title: Introduction to Graph Theory – volume: 78 start-page: 1637 year: 2012 end-page: 1650 ident: br0030 article-title: Multicut in trees viewed through the eyes of vertex cover publication-title: J. Comput. System Sci. – volume: 27 start-page: 65 year: 2014 ident: 10.1016/j.tcs.2015.06.010_br0190 article-title: On the generalized multiway cut in trees problem publication-title: J. Comb. Optim. doi: 10.1007/s10878-012-9565-9 – year: 2010 ident: 10.1016/j.tcs.2015.06.010_br0120 – year: 1999 ident: 10.1016/j.tcs.2015.06.010_br0110 – volume: 23 start-page: 864 year: 1994 ident: 10.1016/j.tcs.2015.06.010_br0090 article-title: The complexity of multiterminal cuts publication-title: SIAM J. Comput. doi: 10.1137/S0097539792225297 – volume: 18 start-page: 3 issue: 1 year: 1997 ident: 10.1016/j.tcs.2015.06.010_br0140 article-title: Primal-dual approximation algorithms for integral flow and multicut in trees publication-title: Algorithmica doi: 10.1007/BF02523685 – start-page: 317 year: 2013 ident: 10.1016/j.tcs.2015.06.010_br0100 article-title: Multi-multiway cut problem on graphs of bounded branch width – start-page: 1713 year: 2012 ident: 10.1016/j.tcs.2015.06.010_br0050 article-title: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset – volume: 74 start-page: 335 issue: 3 year: 2008 ident: 10.1016/j.tcs.2015.06.010_br0170 article-title: Vertex cover might be hard to approximate to within 2−ϵ publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2007.06.019 – volume: 17 start-page: 105 year: 2004 ident: 10.1016/j.tcs.2015.06.010_br0070 article-title: Multiway cut and integer flow problems in trees publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2004.03.016 – volume: 41 start-page: 280 year: 2001 ident: 10.1016/j.tcs.2015.06.010_br0040 article-title: Vertex cover: further observations and further improvements publication-title: J. Algorithms doi: 10.1006/jagm.2001.1186 – volume: 46 start-page: 124 issue: 3 year: 2005 ident: 10.1016/j.tcs.2015.06.010_br0150 article-title: Fixed-parameter tractability and data reduction for multicut in trees publication-title: Networks doi: 10.1002/net.20081 – start-page: 569 year: 2012 ident: 10.1016/j.tcs.2015.06.010_br0180 article-title: Solving planar k-terminal cut in O(nck) time – start-page: 469 year: 2011 ident: 10.1016/j.tcs.2015.06.010_br0220 article-title: Fixed-parameter tractability of multicut parameterized by the size of the cutset – year: 1996 ident: 10.1016/j.tcs.2015.06.010_br0240 – year: 2012 ident: 10.1016/j.tcs.2015.06.010_br0210 article-title: A tight lower bound for planar multiway cut with fixed number of terminals – start-page: 283 year: 2014 ident: 10.1016/j.tcs.2015.06.010_br0160 article-title: Algorithms for cut problems on trees – volume: 21 start-page: 51 year: 1991 ident: 10.1016/j.tcs.2015.06.010_br0060 article-title: On the multiway cut polyhedron publication-title: Networks doi: 10.1002/net.3230210106 – volume: 78 start-page: 1637 issue: 5 year: 2012 ident: 10.1016/j.tcs.2015.06.010_br0030 article-title: Multicut in trees viewed through the eyes of vertex cover publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2012.03.001 – volume: 162 start-page: 55 issue: 1 year: 2005 ident: 10.1016/j.tcs.2015.06.010_br0080 article-title: Minimal multicut and maximal integer multiflow: a survey publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2003.10.037 – year: 2006 ident: 10.1016/j.tcs.2015.06.010_br0230 – start-page: 183 year: 2009 ident: 10.1016/j.tcs.2015.06.010_br0020 article-title: A polynomial kernel for multicut in trees – volume: 351 start-page: 394 issue: 3 year: 2006 ident: 10.1016/j.tcs.2015.06.010_br0200 article-title: Parameterized graph separation problems publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2005.10.007 – volume: 25 start-page: 235 year: 1996 ident: 10.1016/j.tcs.2015.06.010_br0130 article-title: Approximate max-flow min-(multi)cut theorems and their applications publication-title: SIAM J. Comput. doi: 10.1137/S0097539793243016 – start-page: 459 year: 2011 ident: 10.1016/j.tcs.2015.06.010_br0010 article-title: Multicut is FPT |
| SSID | ssj0000576 |
| Score | 2.147189 |
| Snippet | We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 455 |
| SubjectTerms | Algorithms Exact algorithm Multicut Multiway cut Parameterized algorithm Polynomials Roots Terminals Tree Trees |
| Title | Improved parameterized and exact algorithms for cut problems on trees |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.06.010 https://www.proquest.com/docview/1786214260 |
| Volume | 607 |
| WOSCitedRecordID | wos000366773600016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 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/eLvHCXMwtV1Lb9QwELZgywEOPAqIloeMxIlVqji2E_tYoQWKoEJigb1FXu-kzaok1W5SLfx67NhOaCsqQOISRVYelufLzMQz8w1CL4xFVAKETaugKmI0hsiWT0ZcEpoxSJKio1388j47PBSzmfzoU4fWXTuBrKrEZiNP_6uozZgRti2d_Qtx9w81A-bcCN0cjdjN8Y8E77YJjB9pWb2_2WyX8gd0hKxj2NiKSHVyVK_K5thRMYx124x9WxkXOliBzytc9kjqax21bwIx9paz19eq6sJAB9_Vos_xcfQEb9r6uC2HwdZBZEDl1GcFf4WyCcN-H4JwX5DXb45dKpBxRVk28CJdc5Q9cDpWZDJKEtfbOCjh1PW-9WqUcf6LRWautcglZe_2HZZ7jba864R3RKw-SfY8h_YnOw87DeP-Gi2U8OtoK8m4FCO0tX8wmb0bjDfPXHjbzzsEwruUwAsv-p0rc8God57K9C667X8x8L6Dxj10DaptdCe078Bem2-jWx96yt71fTQJuMHncIMNbnCHGzzgBhvcYIMbHHCD6wp3uHmAPr-eTF-9jXyPjUhTGjcRSWMptNAMJAhgLJXGIZdKSR4DnRNeULUodJoxxeO5VERqrqm1ClQuFAFKH6JRVVfwCGGYJ2SRaKWyeMEAlGAFF4VWjBUppYruoDgsV649Ab3tg3KSh0zDZW5WOLcrnNtsSxLvoJf9LaeOfeWqi1mQQe4_AucW5gYwV932PMgrN6rVxstUBXW7zklmfveJbeGw-2-PfoxuDl_KEzRqVi08RTf0WVOuV8889H4CXXOeZQ |
| 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=Improved+parameterized+and+exact+algorithms+for+cut+problems+on+trees&rft.jtitle=Theoretical+computer+science&rft.au=Kanj%2C+Iyad&rft.au=Lin%2C+Guohui&rft.au=Liu%2C+Tian&rft.au=Tong%2C+Weitian&rft.date=2015-11-01&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=607&rft.spage=455&rft.epage=470&rft_id=info:doi/10.1016%2Fj.tcs.2015.06.010&rft.externalDocID=S0304397515005125 |
| 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 |