On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms
Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithm...
Saved in:
| Published in: | Journal of computer science and technology Vol. 29; no. 5; pp. 870 - 878 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.09.2014
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1000-9000, 1860-4749 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems. |
|---|---|
| AbstractList | Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems. Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising, and have led to improved parameterized algorithms for many well-known NP-hard problems. |
| Author | 陈建二 冯启龙 |
| AuthorAffiliation | School of Information Science and Engineering, Central South University, Changsha 410083, China Department of Computer Science, Texas A＆M University,Texas 77843-3112, U.S.A. |
| Author_xml | – sequence: 1 fullname: 陈建二 冯启龙 |
| BookMark | eNp9UUFO3TAQtSoqFX57gO6sdtNFQ8eOEydLhChFglIJWFaW40z-T0jsj53oQ4_Ss_ROvUIdBVGJBZuxR3pv3pt5B2TPOouEvGdwyADkl8BYWkICTCRMyFhekX1W5JDEptyLfwBIyljekIMQOoBUghD75OelpTf21rqdpVeD7nt6NVUBx0C1renZsO1b0470AnWYPIa_f37T77ij12g2tr2bMNDGefpDez3giL79hTU96tfOt-NmCG_J60b3Ad89vity8_Xk-vhbcn55enZ8dJ4YwdIxKRoDhTEVF5iKsoAMC81nizWIKs0yUVbGFFJkUqAUPEcJXBgUtQZW57xJV-TzMnenbaPtWnVu8jYqqi50t_dduK8U8ngcyIDxCP-0wLfezTuMamiDwb7XFt0UFMsly2QhijxCPz6DPo3mZTwwl2VcYUXkgjLeheCxUfFoemydHb1ue8VAzSmpJSUVjag5JTUz2TPm1reD9g8vcvjCCRFr1-j_e3qJ9OFRaOPs-i7ynpTynOdQyCxL_wGqDrGD |
| CitedBy_id | crossref_primary_10_1007_s10878_015_9901_y crossref_primary_10_1016_j_tcs_2016_06_044 crossref_primary_10_1007_s13721_019_0194_4 crossref_primary_10_1007_s11432_015_5355_1 crossref_primary_10_1016_j_tcs_2016_06_012 crossref_primary_10_1007_s10878_016_0023_y |
| Cites_doi | 10.1007/11917496_6 10.1016/j.tcs.2010.12.048 10.1109/TC.2013.163 10.1016/j.tcs.2010.06.026 10.1137/0212040 10.1016/j.cosrev.2008.02.004 10.1073/pnas.1534710100 10.1016/j.jcss.2009.04.002 10.1016/j.tcs.2013.12.011 10.1016/j.tcs.2010.10.042 10.1007/978-1-4612-0515-9 10.1145/210332.210337 10.1016/S0022-0000(03)00075-8 10.1016/j.tcs.2004.12.034 10.1007/978-3-642-38768-5_10 10.1017/S0956796800001143 10.1016/0012-365X(79)90066-9 10.1007/978-3-642-22685-4_31 10.1109/SFCS.1995.492475 10.1007/978-3-662-04131-4 10.1016/j.jcss.2003.09.003 10.1007/s00453-008-9206-y 10.1145/1411509.1411511 10.1007/s00453-007-9130-6 10.1016/j.orl.2003.10.009 10.1007/11847250_4 10.1007/3-540-46784-X_30 10.1016/j.tcs.2013.06.011 10.1093/acprof:oso/9780198566076.001.0001 10.1007/978-3-642-58412-1 10.1006/jagm.1998.0996 10.1016/j.jcss.2008.05.002 10.1017/CBO9780511814075 10.1007/s10878-013-9691-z 10.1016/j.jcss.2008.08.004 10.1016/j.tcs.2012.02.040 10.1016/j.tcs.2013.06.008 10.1137/080716475 10.1145/2071379.2071385 10.1145/318593.318622 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2014 Springer Science+Business Media New York 2014. Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Springer Science+Business Media New York 2014 – notice: Springer Science+Business Media New York 2014. – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.1007/s11390-014-1474-1 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitle | CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) Business Premium Collection (Alumni) |
| DatabaseTitleList | ABI/INFORM Global (Corporate) Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms |
| EISSN | 1860-4749 |
| EndPage | 878 |
| ExternalDocumentID | jsjkxjsxb_e201405012 10_1007_s11390_014_1474_1 662608755 |
| GrantInformation_xml | – fundername: This work was partially supported by the National Natural Science Foundation of China under Grant Nos.61173051,61103033, and 71221061 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 2.D 28- 29K 2B. 2C0 2J2 2JN 2JY 2KG 2KM 2LR 2RA 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VR 5VS 67Z 6NX 7WY 8FE 8FG 8FL 8TC 8UJ 92H 92I 92L 92R 93N 95- 95. 95~ 96X AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AAOBN AARHV AARTL AATNV AATVU AAUYE AAWCG AAWWR AAYFA AAYIU AAYQN AAYTO ABBBX ABBXA ABDZT ABECU ABFGW ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBMV ACBRV ACBXY ACGFS ACHSB ACHXU ACIGE ACIPQ ACKNC ACMDZ ACMLO ACOKC ACOMO ACSNA ACTTH ACVWB ACWMK ACZOJ ADGRI ADHHG ADHIR ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AENEX AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AEYWE AFEXP AFGCZ AFKRA AFLOW AFNRJ AFQWF AFUIB AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCEZO CCPQU CHBEP COF CQIGP CS3 CSCUP CUBFJ CW9 D-I DDRTE DNIVK DPUIP DU5 DWQXO EBLON EBS EIOEI EJD ESBYG F5P FA0 FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS HCIFZ HF~ HG6 HMJXF HQYDN HRMNR HVGLF HZ~ IAO IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV LAK LLZTM M0C M0N M4Y M7S MA- N2Q NB0 NDZJH NF0 NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQBIZ PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCL SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TCJ TGT TSG TSK TSV TUC U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W92 WK8 YLTOR Z7R Z7U Z7X Z7Z Z81 Z83 Z88 Z8R Z8W Z92 ZMTXR ~A9 ~EX ~WA -SI -S~ 5XA 5XJ AACDK AAJBT AASML AAXDM AAYZH ABAKF ABQSL ACDTI ACPIV AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU BSONS CAJEI H13 PQBZA Q-- U1G U5S AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION ICD IVC PHGZM PHGZT PQGLB TGMPQ 7SC 7XB 8AL 8FD 8FK JQ2 L.- L6V L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U 4A8 PMFND PSX |
| ID | FETCH-LOGICAL-c413t-8fc08ccb24e349805e8a20037d04b35549bcc874574e7426e7024ce4da01d62f3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000342412700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1000-9000 |
| IngestDate | Thu May 29 04:00:15 EDT 2025 Tue Nov 04 14:37:44 EST 2025 Wed Nov 05 01:38:52 EST 2025 Sat Nov 29 07:56:38 EST 2025 Tue Nov 18 21:26:39 EST 2025 Fri Feb 21 02:40:04 EST 2025 Wed Feb 14 10:36:31 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | randomized method parameterized computation implicit branching |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c413t-8fc08ccb24e349805e8a20037d04b35549bcc874574e7426e7024ce4da01d62f3 |
| Notes | 11-2296/TP Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems. Jianer Chen,Qi-Long Feng（1School of Information Science and Engineering, Central South University, Changsha 410083, China ;2Department of Computer Science, Texas A＆M University, Texas 77843-3112, U.S.A.） parameterized computation; randomized method; implicit branching ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| PQID | 2918627941 |
| PQPubID | 326258 |
| PageCount | 9 |
| ParticipantIDs | wanfang_journals_jsjkxjsxb_e201405012 proquest_miscellaneous_1671578486 proquest_journals_2918627941 crossref_citationtrail_10_1007_s11390_014_1474_1 crossref_primary_10_1007_s11390_014_1474_1 springer_journals_10_1007_s11390_014_1474_1 chongqing_primary_662608755 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-09-01 |
| PublicationDateYYYYMMDD | 2014-09-01 |
| PublicationDate_xml | – month: 09 year: 2014 text: 2014-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Boston |
| PublicationPlace_xml | – name: Boston – name: Beijing |
| PublicationTitle | Journal of computer science and technology |
| PublicationTitleAbbrev | J. Comput. Sci. Technol |
| PublicationTitleAlternate | Journal of Computer Science and Technology |
| PublicationTitle_FL | Journal of Computer Science & Technology |
| PublicationYear | 2014 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Stege U. Resolving conflicts from problems in computational biology [Ph.D. Thesis]. No. 13364, ETH Zöurich, 2000. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M. Complexity and Approximation—Combinatorial Optimization Problems and Their Approximability Properties. Springer Verlag, 1999. ChenJKanjIAConstrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithmsJournal of Computer and System Sciences200367483384720365161091.6807610.1016/j.jcss.2003.09.003 WangJFengQChenJAn O*(3:533k)-time parameterized algorithm for the 3-set packing problemTheoretical Computer Science2011412181745175328102151213.6872110.1016/j.tcs.2010.12.048 MahajanMRamanVSikdarSParameterizing above or below guaranteed valuesJ. Comput. Syst. Sci.200975213715324827511155.6840010.1016/j.jcss.2008.08.004 Chen J, Liu Y, Lu S, O'Sullivan B, Razgon I. A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM, 2008, 55(5): Article No. 21. FengQWangJChenJMatching and weighted P2-Packing: Algorithms and kernelsTheoretical Computer Science2014522859431540601279.6810110.1016/j.tcs.2013.12.011 Mahajan M, Raman V, Sikdar S. Parameterizing MAX SNP problems above guaranteed values. In Proc. the 2nd Int. Workshop IWPEC, Sept. 2006, pp.38–49. ChenJFengQLiuYLuSWangJImproved deterministic algorithms for weighted matching and packing problemsTheoretical Computer Science2011412232503251228157921215.6810910.1016/j.tcs.2010.10.042 Lichtenstein O, Pnueli A. Checking that finite state concurrent programs satisfy their linear specification. In Proc. the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Jan. 1985, pp.97–107. ChenJLiuYLuSAn improved parameterized algorithm for the minimum node multiway cut problemAlgorithmica2009551111325069241194.6816810.1007/s00453-007-9130-6 MahajanMRamanVParametrizing above guaranteed values: MaxSat and MaxCutJ. Algorithms199931233535416842800921.6805210.1006/jagm.1998.0996 Roth-Korostensky C. Algorithms for building multiple sequence alignments and evolutionary trees [Ph.D. Thesis]. No. 13550, ETH Zöurich, 2000. DemingRIndependence numbers of graphs—An extension of the Köonig-Egerváry theoremDiscrete Mathematics197927123335349500404.0503410.1016/0012-365X(79)90066-9 ReedBSmithKVettaAFinding odd cycle transversalsOperations Research Letters200432429930120577811052.0506110.1016/j.orl.2003.10.009 LuoWWangJGuoJChenJParameterized complexity of Max-lifetime Target Coverage in wireless sensor networksTheoretical Computer Science2014518324131468420624449310.1016/j.tcs.2013.06.008 Feng Q, Wang J, Li S, Chen J. Random methods for parameterized problems. In Proc. the 19th COCOON, Jun. 2013, pp.89-100. Naor M, Schulman L, Srinivasan A. Splitters and near-optimal derandomization. In Proc. the 36th Annual Symposium on FOCS, Oct. 1995, pp.182–193. Chen J, Kanj I A, Xia G. Improved upper bounds for vertex cover. Theoretical Computer Science, 2010, 411(40/41/42): 3736–3756. DowneyRFellowsMParameterized Complexity1999New YorkSpringer-Verlag10.1007/978-1-4612-0515-9 HengleinFMairsonHGThe complexity of type inference for higher-order typed lambda calculiJournal of Functional Programming19944443547713061460827.0300510.1017/S0956796800001143 ChenJFominFLiuYLuSVillangerYImproved algorithms for the feedback vertex set problemsJournal of Computer and System Sciences20087471188119824540631152.6805510.1016/j.jcss.2008.05.002 WangJLiWLiSChenJOn the parameterized vertex cover problem for graphs with perfect matchingScience China Information Sciences20145771123216879 CheethamJDehneFRau-ChaplinAStegeUTaillonPJSolving large FPT problems on coarse-granined parallel machinesJournal of Computer and System Sciences200367469170620365081114.6842810.1016/S0022-0000(03)00075-8 Feng Q, Wang J, Li S, Chen J. Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. Journal of Combinatorial Optimization, 2014. (to be appeared) MichalewiczZFogelDBHow to Solve It: Modern Heuristics2000BerlinSpringer-Verlag10.1007/978-3-662-04131-4 Chen J, Kanj I A. On approximating minimum vertex cover for graphs with perfect matching. Theoretical Computer Science, 2005, 337(1/2/3): 305–318. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006. WangJLuoWFengQGuoJParameterized complexity of Min-power multicast problems in wireless ad hoc networksTheoretical Computer Science2013508162531174630623935110.1016/j.tcs.2012.02.040 Wang J, Tan P, Yao J, Feng Q, Chen J. On the minimum link-length rectilinear spanning path problem: Complexity and algorithms. IEEE Transactions on Computers, doi.ieeecomputersociety.org/10.1109/TC.2013.163, 2013 (preprint). Chen J, Lu S, Sze S H, Zhang F. Improved algorithms for path, matching, and packing problems. In Proc. the 18th Annual ACM-SIAM SODA, Jan. 2007, pp.298–307. Chen J, Liu Y, Lu S, Sze S H, Zhang F. Iterative expansion and color coding: An improved algorithm for 3D-matching. ACM Transactions on Algorithms, 2012, 8(1): Article No.6. WangJLuoWFengQGuoJChenJImproved linear problem kernel for planar connected dominating setTheoretical Computer Science201351121231269120624462310.1016/j.tcs.2013.06.011 MotwaniRRaghavanPRandomized Algorithms1995New YorkCambridge University Press0849.6803910.1017/CBO9780511814075 Chen J, Kanj I A, Jia W. Vertex cover: Further observations and further improvements. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science-WG, Jun. 1999, pp.313–324. AlonNYusterRZwickUColor-codingJournal of the ACM199542484485614117870885.6811610.1145/210332.210337 Feng Q, Wang J, Chen J. Matching and P2-Packing: Weighted versions. In Proc. the 17th COCOON, Aug. 2011, pp.343–353. ChenJLuSImproved parameterized set splitting algorithms: A probabilistic approachAlgorithmica200954447248925058241192.6885410.1007/s00453-008-9206-y ChenJKneisJLuSMolleDRichterSRossmanithPSzeSHZhangFRandomized divide-and-conquer: Improved path, matching, and packing algorithmsSIAM J. Comput.20093862526254725063021191.6884910.1137/080716475 KelleyBPSharanRKarpRMSittlerTRootDEStock-wellBRIdekerTConserved pathways within bacteria and yeast as revealed by global protein network alignmentProc. Natl. Acad. Sci.200310020113941139910.1073/pnas.1534710100 Kneis J, Möolle D, Richter S, Rossmanith P. Divide-and-color. In Proc. the 32nd Int. Workshop WG, Jun. 2006, pp.58–67. RazgonIO'SullivanBAlmost 2-SAT is fixed-parameter tractableJournal of Computer and System Sciences200975843545025683671184.6847710.1016/j.jcss.2009.04.002 Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, W. H. Freeman and Company, 1979. DornFFominFVThilikosDMSubexponential parameterized algorithmsComputer Science Review200821293910.1016/j.cosrev.2008.02.004 KirkpatrickDGHellPOn the complexity of general graph factor problemsSIAM Journal on Computing19831236016097074160525.6802310.1137/0212040 1474_CR30 1474_CR12 1474_CR34 1474_CR11 1474_CR10 B Reed (1474_CR21) 2004; 32 1474_CR32 BP Kelley (1474_CR22) 2003; 100 1474_CR31 1474_CR38 1474_CR14 J Wang (1474_CR35) 2011; 412 I Razgon (1474_CR42) 2009; 75 N Alon (1474_CR17) 1995; 42 DG Kirkpatrick (1474_CR25) 1983; 12 M Mahajan (1474_CR41) 2009; 75 J Chen (1474_CR16) 2003; 67 M Mahajan (1474_CR39) 1999; 31 Z Michalewicz (1474_CR8) 2000 1474_CR1 J Chen (1474_CR24) 2009; 54 1474_CR5 1474_CR6 1474_CR40 1474_CR9 J Wang (1474_CR4) 2013; 508 R Downey (1474_CR19) 1999 J Chen (1474_CR36) 2008; 74 J Chen (1474_CR37) 2009; 55 J Wang (1474_CR43) 2014; 57 J Wang (1474_CR3) 2013; 511 F Dorn (1474_CR18) 2008; 2 1474_CR45 1474_CR20 1474_CR26 F Henglein (1474_CR15) 1994; 4 R Deming (1474_CR44) 1979; 27 J Cheetham (1474_CR13) 2003; 67 J Chen (1474_CR23) 2009; 38 1474_CR29 1474_CR28 J Chen (1474_CR33) 2011; 412 W Luo (1474_CR2) 2014; 518 Q Feng (1474_CR27) 2014; 522 R Motwani (1474_CR7) 1995 |
| References_xml | – reference: WangJLuoWFengQGuoJChenJImproved linear problem kernel for planar connected dominating setTheoretical Computer Science201351121231269120624462310.1016/j.tcs.2013.06.011 – reference: FengQWangJChenJMatching and weighted P2-Packing: Algorithms and kernelsTheoretical Computer Science2014522859431540601279.6810110.1016/j.tcs.2013.12.011 – reference: KelleyBPSharanRKarpRMSittlerTRootDEStock-wellBRIdekerTConserved pathways within bacteria and yeast as revealed by global protein network alignmentProc. Natl. Acad. Sci.200310020113941139910.1073/pnas.1534710100 – reference: ChenJFominFLiuYLuSVillangerYImproved algorithms for the feedback vertex set problemsJournal of Computer and System Sciences20087471188119824540631152.6805510.1016/j.jcss.2008.05.002 – reference: AlonNYusterRZwickUColor-codingJournal of the ACM199542484485614117870885.6811610.1145/210332.210337 – reference: KirkpatrickDGHellPOn the complexity of general graph factor problemsSIAM Journal on Computing19831236016097074160525.6802310.1137/0212040 – reference: LuoWWangJGuoJChenJParameterized complexity of Max-lifetime Target Coverage in wireless sensor networksTheoretical Computer Science2014518324131468420624449310.1016/j.tcs.2013.06.008 – reference: Mahajan M, Raman V, Sikdar S. Parameterizing MAX SNP problems above guaranteed values. In Proc. the 2nd Int. Workshop IWPEC, Sept. 2006, pp.38–49. – reference: WangJLuoWFengQGuoJParameterized complexity of Min-power multicast problems in wireless ad hoc networksTheoretical Computer Science2013508162531174630623935110.1016/j.tcs.2012.02.040 – reference: MichalewiczZFogelDBHow to Solve It: Modern Heuristics2000BerlinSpringer-Verlag10.1007/978-3-662-04131-4 – reference: Chen J, Kanj I A, Xia G. Improved upper bounds for vertex cover. Theoretical Computer Science, 2010, 411(40/41/42): 3736–3756. – reference: DemingRIndependence numbers of graphs—An extension of the Köonig-Egerváry theoremDiscrete Mathematics197927123335349500404.0503410.1016/0012-365X(79)90066-9 – reference: MotwaniRRaghavanPRandomized Algorithms1995New YorkCambridge University Press0849.6803910.1017/CBO9780511814075 – reference: ChenJLuSImproved parameterized set splitting algorithms: A probabilistic approachAlgorithmica200954447248925058241192.6885410.1007/s00453-008-9206-y – reference: Kneis J, Möolle D, Richter S, Rossmanith P. Divide-and-color. In Proc. the 32nd Int. Workshop WG, Jun. 2006, pp.58–67. – reference: Wang J, Tan P, Yao J, Feng Q, Chen J. On the minimum link-length rectilinear spanning path problem: Complexity and algorithms. IEEE Transactions on Computers, doi.ieeecomputersociety.org/10.1109/TC.2013.163, 2013 (preprint). – reference: Chen J, Lu S, Sze S H, Zhang F. Improved algorithms for path, matching, and packing problems. In Proc. the 18th Annual ACM-SIAM SODA, Jan. 2007, pp.298–307. – reference: ChenJFengQLiuYLuSWangJImproved deterministic algorithms for weighted matching and packing problemsTheoretical Computer Science2011412232503251228157921215.6810910.1016/j.tcs.2010.10.042 – reference: Feng Q, Wang J, Chen J. Matching and P2-Packing: Weighted versions. In Proc. the 17th COCOON, Aug. 2011, pp.343–353. – reference: ReedBSmithKVettaAFinding odd cycle transversalsOperations Research Letters200432429930120577811052.0506110.1016/j.orl.2003.10.009 – reference: ChenJLiuYLuSAn improved parameterized algorithm for the minimum node multiway cut problemAlgorithmica2009551111325069241194.6816810.1007/s00453-007-9130-6 – reference: Chen J, Kanj I A. On approximating minimum vertex cover for graphs with perfect matching. Theoretical Computer Science, 2005, 337(1/2/3): 305–318. – reference: Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, W. H. Freeman and Company, 1979. – reference: WangJLiWLiSChenJOn the parameterized vertex cover problem for graphs with perfect matchingScience China Information Sciences20145771123216879 – reference: RazgonIO'SullivanBAlmost 2-SAT is fixed-parameter tractableJournal of Computer and System Sciences200975843545025683671184.6847710.1016/j.jcss.2009.04.002 – reference: Stege U. Resolving conflicts from problems in computational biology [Ph.D. Thesis]. No. 13364, ETH Zöurich, 2000. – reference: Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006. – reference: Chen J, Liu Y, Lu S, O'Sullivan B, Razgon I. A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM, 2008, 55(5): Article No. 21. – reference: MahajanMRamanVParametrizing above guaranteed values: MaxSat and MaxCutJ. Algorithms199931233535416842800921.6805210.1006/jagm.1998.0996 – reference: Feng Q, Wang J, Li S, Chen J. Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. Journal of Combinatorial Optimization, 2014. (to be appeared) – reference: CheethamJDehneFRau-ChaplinAStegeUTaillonPJSolving large FPT problems on coarse-granined parallel machinesJournal of Computer and System Sciences200367469170620365081114.6842810.1016/S0022-0000(03)00075-8 – reference: HengleinFMairsonHGThe complexity of type inference for higher-order typed lambda calculiJournal of Functional Programming19944443547713061460827.0300510.1017/S0956796800001143 – reference: Naor M, Schulman L, Srinivasan A. Splitters and near-optimal derandomization. In Proc. the 36th Annual Symposium on FOCS, Oct. 1995, pp.182–193. – reference: Roth-Korostensky C. Algorithms for building multiple sequence alignments and evolutionary trees [Ph.D. Thesis]. No. 13550, ETH Zöurich, 2000. – reference: Feng Q, Wang J, Li S, Chen J. Random methods for parameterized problems. In Proc. the 19th COCOON, Jun. 2013, pp.89-100. – reference: WangJFengQChenJAn O*(3:533k)-time parameterized algorithm for the 3-set packing problemTheoretical Computer Science2011412181745175328102151213.6872110.1016/j.tcs.2010.12.048 – reference: Chen J, Liu Y, Lu S, Sze S H, Zhang F. Iterative expansion and color coding: An improved algorithm for 3D-matching. ACM Transactions on Algorithms, 2012, 8(1): Article No.6. – reference: Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M. Complexity and Approximation—Combinatorial Optimization Problems and Their Approximability Properties. Springer Verlag, 1999. – reference: Chen J, Kanj I A, Jia W. Vertex cover: Further observations and further improvements. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science-WG, Jun. 1999, pp.313–324. – reference: MahajanMRamanVSikdarSParameterizing above or below guaranteed valuesJ. Comput. Syst. Sci.200975213715324827511155.6840010.1016/j.jcss.2008.08.004 – reference: ChenJKneisJLuSMolleDRichterSRossmanithPSzeSHZhangFRandomized divide-and-conquer: Improved path, matching, and packing algorithmsSIAM J. Comput.20093862526254725063021191.6884910.1137/080716475 – reference: Lichtenstein O, Pnueli A. Checking that finite state concurrent programs satisfy their linear specification. In Proc. the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Jan. 1985, pp.97–107. – reference: ChenJKanjIAConstrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithmsJournal of Computer and System Sciences200367483384720365161091.6807610.1016/j.jcss.2003.09.003 – reference: DowneyRFellowsMParameterized Complexity1999New YorkSpringer-Verlag10.1007/978-1-4612-0515-9 – reference: DornFFominFVThilikosDMSubexponential parameterized algorithmsComputer Science Review200821293910.1016/j.cosrev.2008.02.004 – ident: 1474_CR32 doi: 10.1007/11917496_6 – volume: 412 start-page: 1745 issue: 18 year: 2011 ident: 1474_CR35 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2010.12.048 – ident: 1474_CR5 doi: 10.1109/TC.2013.163 – ident: 1474_CR12 doi: 10.1016/j.tcs.2010.06.026 – volume: 12 start-page: 601 issue: 3 year: 1983 ident: 1474_CR25 publication-title: SIAM Journal on Computing doi: 10.1137/0212040 – ident: 1474_CR10 – volume: 2 start-page: 29 issue: 1 year: 2008 ident: 1474_CR18 publication-title: Computer Science Review doi: 10.1016/j.cosrev.2008.02.004 – volume: 100 start-page: 11394 issue: 20 year: 2003 ident: 1474_CR22 publication-title: Proc. Natl. Acad. Sci. doi: 10.1073/pnas.1534710100 – volume: 75 start-page: 435 issue: 8 year: 2009 ident: 1474_CR42 publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2009.04.002 – volume: 522 start-page: 85 year: 2014 ident: 1474_CR27 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2013.12.011 – volume: 412 start-page: 2503 issue: 23 year: 2011 ident: 1474_CR33 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2010.10.042 – volume-title: Parameterized Complexity year: 1999 ident: 1474_CR19 doi: 10.1007/978-1-4612-0515-9 – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 1474_CR17 publication-title: Journal of the ACM doi: 10.1145/210332.210337 – volume: 67 start-page: 691 issue: 4 year: 2003 ident: 1474_CR13 publication-title: Journal of Computer and System Sciences doi: 10.1016/S0022-0000(03)00075-8 – ident: 1474_CR38 doi: 10.1016/j.tcs.2004.12.034 – ident: 1474_CR28 doi: 10.1007/978-3-642-38768-5_10 – volume: 4 start-page: 435 issue: 4 year: 1994 ident: 1474_CR15 publication-title: Journal of Functional Programming doi: 10.1017/S0956796800001143 – volume: 27 start-page: 23 issue: 1 year: 1979 ident: 1474_CR44 publication-title: Discrete Mathematics doi: 10.1016/0012-365X(79)90066-9 – ident: 1474_CR26 doi: 10.1007/978-3-642-22685-4_31 – ident: 1474_CR31 doi: 10.1109/SFCS.1995.492475 – volume-title: How to Solve It: Modern Heuristics year: 2000 ident: 1474_CR8 doi: 10.1007/978-3-662-04131-4 – ident: 1474_CR1 – ident: 1474_CR30 – volume: 57 start-page: 1 issue: 7 year: 2014 ident: 1474_CR43 publication-title: Science China Information Sciences – volume: 67 start-page: 833 issue: 4 year: 2003 ident: 1474_CR16 publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2003.09.003 – volume: 54 start-page: 472 issue: 4 year: 2009 ident: 1474_CR24 publication-title: Algorithmica doi: 10.1007/s00453-008-9206-y – ident: 1474_CR45 doi: 10.1145/1411509.1411511 – volume: 55 start-page: 1 issue: 11 year: 2009 ident: 1474_CR37 publication-title: Algorithmica doi: 10.1007/s00453-007-9130-6 – volume: 32 start-page: 299 issue: 4 year: 2004 ident: 1474_CR21 publication-title: Operations Research Letters doi: 10.1016/j.orl.2003.10.009 – ident: 1474_CR40 doi: 10.1007/11847250_4 – ident: 1474_CR9 – ident: 1474_CR11 doi: 10.1007/3-540-46784-X_30 – volume: 511 start-page: 2 year: 2013 ident: 1474_CR3 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2013.06.011 – ident: 1474_CR20 doi: 10.1093/acprof:oso/9780198566076.001.0001 – ident: 1474_CR6 doi: 10.1007/978-3-642-58412-1 – volume: 31 start-page: 335 issue: 2 year: 1999 ident: 1474_CR39 publication-title: J. Algorithms doi: 10.1006/jagm.1998.0996 – volume: 74 start-page: 1188 issue: 7 year: 2008 ident: 1474_CR36 publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2008.05.002 – volume-title: Randomized Algorithms year: 1995 ident: 1474_CR7 doi: 10.1017/CBO9780511814075 – ident: 1474_CR29 doi: 10.1007/s10878-013-9691-z – volume: 75 start-page: 137 issue: 2 year: 2009 ident: 1474_CR41 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2008.08.004 – volume: 508 start-page: 16 year: 2013 ident: 1474_CR4 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2012.02.040 – volume: 518 start-page: 32 year: 2014 ident: 1474_CR2 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2013.06.008 – volume: 38 start-page: 2526 issue: 6 year: 2009 ident: 1474_CR23 publication-title: SIAM J. Comput. doi: 10.1137/080716475 – ident: 1474_CR34 doi: 10.1145/2071379.2071385 – ident: 1474_CR14 doi: 10.1145/318593.318622 |
| SSID | ssj0037044 |
| Score | 2.018163 |
| Snippet | Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become... Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems. Developing efficient parameterized algorithms has... |
| SourceID | wanfang proquest crossref springer chongqing |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 870 |
| SubjectTerms | Algorithms Artificial Intelligence Computation Computer Science Data Structures and Information Theory Information Systems Applications (incl.Internet) NP难问题 Parameterization Regular Paper Software Engineering Theory of Computation 亚群 参数算法 技术 算法参数 计算机科学 高效算法 |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LT9RAGJ8oevAiPmMFyZjoRdPYaaed1oshBKIHkQRISDxMpvNYWJdZYAoh_PV8X7ez1ctevPTS6bTN937M9yPkg9CGK-N4qgqXQ4BiXKqqlqdasBYsSt3kRvdgE2J_vz45aQ6GhFsY2iqjTuwVtZlrzJF_yRsGzjdwD_t2cZkiahRWVwcIjYfkEU5JYH3r3mHUxIXIejBXTGGnCI4Zq5r90TlwfbAli6eMC7jgbIXTuZ9cgsX410aNjueyVtqf8PFO-clfxmhv_X9_4xl5OrihdHvBN8_JA-tfkPUI8UAHiX9Jfv_y9Nhj4s3Tw3M1m1HUNLYLVHlDf_Tt6Gcd_bnINIavFJQmPYpzYQMFl5geKGwAw5nQd9bQ7dkEvqc7PQ-vyPHe7tHO93TAY0g1mLourZ3Oaq3bnNuCN3VW2lphb5swGW_Rb2larXF8vuAWIu7KCnAAtOVGZcxUuStekzU_9_YNoRy4oqhL0fKy4K5lTWly62omhHVGV21CNpbUkBeLuRuywuAL4qsyIVmkj9TDKHNE1JjJcQgzklcCeSWSV7KEfFo-EvdbsXgzEk8OIh3kSLmEvF_eBmHECovydn4dJKsEAxXI6yohnyOzjFuseOHHgZ_GxdMw_XM7DbettDmGwSW4Em9Xf9gGeYJLFy1wm2Stu7q278hjfdOdhautXjbuAdUbExU priority: 102 providerName: ProQuest |
| Title | On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms |
| URI | http://lib.cqvip.com/qk/85226X/201405/662608755.html https://link.springer.com/article/10.1007/s11390-014-1474-1 https://www.proquest.com/docview/2918627941 https://www.proquest.com/docview/1671578486 https://d.wanfangdata.com.cn/periodical/jsjkxjsxb-e201405012 |
| Volume | 29 |
| WOSCitedRecordID | wos000342412700012&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: 7WY dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: M0C dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: P5Z dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: K7- dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: M7S dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1860-4749 dateEnd: 20241211 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: BENPR dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1860-4749 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0037044 issn: 1000-9000 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1db9Mw0GIbD7wwxocoG5WR4AUUKR9OnPC2TZuY0Eq1bjDgwXJsp2vpXKgzNO3Xc5fGDUhoErycFNk-Rz7fl32-I-QlV5pJXbFAJlUMDoquApmVLFA8KkGj5EWsVVNsgg8G-fl5MWzfcTsf7e6vJBtJ3T12A2MFg6hYEDEOYI1sgLbLsV7DyeijF78JD5sKrnhuHWBFTH-V-TcUmFDhYm7HP2C6PxVTZ22uLkibZz22knb8mwY63Pyvf39A7rcGJ91d7pAtcsfYh2TTF3OgLW8_Il8_WHpm8YjN0tGlnM0oyhRTOyqtpkdN4PmkpsfLM0X3loJ4pKc-A6yjYPzSocRQL8z-fGM03Z2N54tJfXHpHpOzw4PT_XdBW3khUKDU6iCvVJgrVcbMJAyWODW5xCg2rkNWooVSlEphonzODPjWmeGg6pVhWoaRzuIqeULW7dyap4QyoH-Sp7xkacKqMipSHZsqjzg3lVZZ2SPbKxKI78sMGyJDNws8qbRHQk8Uodqk5Vg7Yya6dMu4tAKWVuDSiqhHXq-GeHy3dN7xlBYt8zoRFxH4eSCooPnFqhnYDu9SpDXzKyeijEcg7Fie9cgbT_MOxS0Tvmo3Udd56qbfrqfuuhQmRoc3BaPh2T9h3Sb3cOQy9m2HrNeLK_Oc3FU_64lb9Mka__S5Tzb2DgbDE_h6zwOAx-E-Qj4COEy_9Bsu-gWf4w6W |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQXylOEFjASvYAi8nDiBAmhCqi62napxFaqxMEktrPtsvW2TQqFH8VvZCYb78Jlbz1wySWxE8efv3l4PAPwQijNC11xv4irCA0UXflFWnJfibBEiZLlkVZtsQkxGGSHh_n-Cvx2Z2EorNJxYkvUeqrIR_46ykNUvhE94bvTM5-qRtHuqiuhMYNF3_z8gSZb_bb3Aed3M4q2Pw7f7_hdVQFfIWE3flapIFOqjLiJeZ4FickKitASOuAlSd-8VIqSwAtu0G5MjUAxpgzXRRDqNKpi7PcaXOdxJmhd9YXvmD8WQVs8llzmPhXjdLuo7VE9VLUoBIz7IRd4oVwOR1M7OkMJ9a9MXCi6873Z9kSRrQo7-kv4ba_9b7_tDtzu1Gy2NVsXd2HF2Huw5kpYsI7R7sOXT5YdWHIsWvb5pJhMGDGpaWpWWM16bbj9ccP2Zp7U-g1DocCGLu9tzVDlZ_sFBbhRzutfRrOtyQjH3xyd1A_g4EqG-BBW7dSaR8A4oj7OElHyJOZVGeaJjkyVhUKYSqu09GB9PvvydJZXRKZkXKL9mHgQODxI1aVqp4ohE7lIMk1wkggnSXCSoQcv501cf0se3nBgkR1l1XKBFA-ez28j2dAOUmHN9KKWYSpCpHiepR68cuBcdLHkhZsdfhcPj-vxt8txfVlKE5GZn6Cq9Hj5hz2DmzvDvV252xv01-EWNZuF-23AanN-YZ7ADfW9Oa7Pn7brksHXq0b0H68EbaI |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagIMSl5Sm2LWAkuICi5uHECbcKWFEBy0ptUSUOluPHdpett6xTVPHrmdnEG5BQJcQlFydjxeN5ecbfEPKcK82ktiySmU0hQNE2kkXNIsWTGixKWaVarZpN8NGoPDmpxl2fUx-q3UNKsr3TgChNrtk713avv_gGjgsWVLEoYRwe18kNhnX0GK4ffgmqOOPxqpsrnmFH2B0zpDX_RgLBFU4XbvIdpv7TSPWe5zpZurri46x0k9-s0XDrv__jDtnsHFG63-6cu-SacffIVmjyQDuZv0--fnb02OHRm6OHZ3I-p6hrTOOpdJoerArSpw391J41-tcU1CY9CsiwnoJTTMcSS8AQFfqn0XR_Plksp83pmX9Ajofvjt68j7qODJECY9dEpVVxqVSdMpOxqoxzU0qsbuM6ZjV6LlWtFALoc2Yg5i4MBxdAGaZlnOgitdlDsuEWzjwilMG-yMqc1yzPmK2TKtepsWXCubFaFfWA7KzZIc5b5A1RYPgFEVY-IHFgkFAdmDn21JiLHoYZl1bA0gpcWpEMyMv1J4HeFS_vBq6LTqi9SKsE4j9QYDD8bD0M4og5FunM4sKLpOAJKEFWFgPyKvC_J3HFhC-6DdW_PPOzb5czf1kLk2IgnIMzsf1PVJ-SW-O3Q_HxYPRhh9xGIm153C7ZaJYX5jG5qX40U798shKbX1mQFBM |
| 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=On+Unknown+Small+Subsets+and+Implicit+Measures%EF%BC%9ANew+Techniques+for+Parameterized+Algorithms&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E6%8A%80%E6%9C%AF%E5%AD%A6%E6%8A%A5%EF%BC%88%E8%8B%B1%E6%96%87%E7%89%88%EF%BC%89&rft.au=Jianer+Chen&rft.au=Qi-Long+Feng&rft.date=2014-09-01&rft.issn=1000-9000&rft.issue=5&rft.spage=870&rft.epage=878&rft_id=info:doi/10.1007%2Fs11390-014-1474-1&rft.externalDocID=jsjkxjsxb_e201405012 |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F85226X%2F85226X.jpg http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjkxjsxb-e%2Fjsjkxjsxb-e.jpg |