Improved upper bounds for vertex cover
This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying con...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 411; číslo 40-42; s. 3736 - 3756 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Oxford
Elsevier
06.09.2010
|
| Predmet: | |
| ISSN: | 0304-3975 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying conservative worst-case-scenario assumption. The contribution of the paper lies in the simplicity, uniformity, and obliviousness of the algorithm presented. Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis. The algorithm also improves the O ( 1.274 5 k k 4 + k n ) -time exponential-space upper bound for the problem by Chandran and Grandoni. |
|---|---|
| AbstractList | This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying conservative worst-case-scenario assumption. The contribution of the paper lies in the simplicity, uniformity, and obliviousness of the algorithm presented. Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis. The algorithm also improves the O ( 1.274 5 k k 4 + k n ) -time exponential-space upper bound for the problem by Chandran and Grandoni. |
| Author | Chen, Jianer Xia, Ge Kanj, Iyad A. |
| Author_xml | – sequence: 1 givenname: Jianer surname: Chen fullname: Chen, Jianer – sequence: 2 givenname: Iyad A. surname: Kanj fullname: Kanj, Iyad A. – sequence: 3 givenname: Ge surname: Xia fullname: Xia, Ge |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23263736$$DView record in Pascal Francis |
| BookMark | eNp1kL1OwzAURj0UibbwAGxZgCnhOo7teEQVP5UqscBsOY4tJUrjYDsVvD2uWhYk7mJd-Xyfrs4KLUY3GoRuMBQYMHvoi6hDUULagRVQsgVaAoEqJ4LTS7QKoYc0lLMlutvuJ-8Ops3maTI-a9w8tiGzzmcH46P5ynT69VfowqohmOvzu0Yfz0_vm9d89_ay3Tzuck2Ax7wR2AKnhqqS1k3FsbKWCYYVty00hnCFQVBOFa21xTXTpK1IyXRbiqYW0JI1uj_1pqM-ZxOi3HdBm2FQo3FzkLzmuBasqhJ5eyZV0GqwXo26C3Ly3V75b1mmWsIJSxw_cdq7ELyxUndRxc6N0atukBjkUZrsZZImj9IkMJmkpST-k_wt_z_zAy00c1U |
| CODEN | TCSCDI |
| CitedBy_id | crossref_primary_10_3390_axioms11050191 crossref_primary_10_1007_s00453_017_0297_1 crossref_primary_10_1016_j_jcss_2011_10_003 crossref_primary_10_1017_S0960129523000439 crossref_primary_10_1016_j_tcs_2024_114507 crossref_primary_10_1016_j_tcs_2024_114625 crossref_primary_10_1108_DTA_11_2023_0788 crossref_primary_10_1016_j_artint_2014_12_001 crossref_primary_10_4018_IJCWT_2017070103 crossref_primary_10_1016_j_tcs_2024_114508 crossref_primary_10_1145_3504027 crossref_primary_10_1137_23M1589347 crossref_primary_10_1016_j_jpdc_2021_05_005 crossref_primary_10_1016_j_tcs_2011_09_009 crossref_primary_10_1007_s10878_012_9575_7 crossref_primary_10_1007_s10878_017_0127_z crossref_primary_10_1016_j_jcss_2010_12_002 crossref_primary_10_1007_s10601_015_9198_6 crossref_primary_10_1007_s10732_020_09465_7 crossref_primary_10_1007_s00224_022_10076_x crossref_primary_10_1145_3319909 crossref_primary_10_1109_TCAD_2018_2859255 crossref_primary_10_1016_j_artint_2014_06_006 crossref_primary_10_1007_s11128_023_03962_x crossref_primary_10_1016_j_dam_2020_12_015 crossref_primary_10_1016_j_proeng_2016_01_248 crossref_primary_10_1109_TITS_2022_3207499 crossref_primary_10_1007_s00453_023_01129_9 crossref_primary_10_1016_j_pmcj_2019_101033 crossref_primary_10_1016_j_jcss_2017_04_003 crossref_primary_10_1016_j_ejc_2022_103662 crossref_primary_10_1109_ACCESS_2019_2915550 crossref_primary_10_1007_s00453_017_0349_6 crossref_primary_10_1016_j_jpdc_2015_07_006 crossref_primary_10_1016_j_tcs_2012_12_003 crossref_primary_10_1016_j_tcs_2024_114513 crossref_primary_10_1137_120883736 crossref_primary_10_1007_s00224_012_9393_4 crossref_primary_10_1016_j_ejc_2012_04_008 crossref_primary_10_1016_j_tcs_2015_09_023 crossref_primary_10_1016_j_jcss_2023_103466 crossref_primary_10_1007_s00453_014_9925_1 crossref_primary_10_14778_3407790_3407809 crossref_primary_10_1007_s00224_016_9716_y crossref_primary_10_1007_s10878_017_0115_3 crossref_primary_10_1016_j_jcss_2023_01_004 crossref_primary_10_1016_j_tcs_2013_07_019 crossref_primary_10_1007_s00453_015_9980_2 crossref_primary_10_1137_16M1104585 crossref_primary_10_1109_TITS_2024_3510532 crossref_primary_10_1016_j_cosrev_2020_100344 crossref_primary_10_1016_j_jcss_2023_03_003 crossref_primary_10_1016_j_jcss_2023_03_004 crossref_primary_10_1016_j_cosrev_2011_09_002 crossref_primary_10_1145_3313234 crossref_primary_10_3390_a9010021 crossref_primary_10_1109_ACCESS_2019_2895738 crossref_primary_10_1007_s00778_022_00738_0 crossref_primary_10_1016_j_cosrev_2022_100490 crossref_primary_10_1016_j_jcss_2024_103532 crossref_primary_10_1007_s13347_022_00552_0 crossref_primary_10_1016_j_jcss_2024_103531 crossref_primary_10_1016_j_tcs_2014_11_029 crossref_primary_10_1016_j_ipl_2013_11_007 crossref_primary_10_1007_s10107_021_01706_2 crossref_primary_10_1007_s00453_022_01003_0 crossref_primary_10_1016_j_tcs_2017_07_010 crossref_primary_10_1080_01605682_2019_1621218 crossref_primary_10_1137_16M109017X crossref_primary_10_1016_j_tcs_2012_10_052 crossref_primary_10_1007_s00224_021_10045_w crossref_primary_10_1007_s10878_015_9969_4 crossref_primary_10_1145_2566616 crossref_primary_10_1007_s00224_023_10132_0 crossref_primary_10_1007_s00453_014_9920_6 crossref_primary_10_1016_j_ejor_2017_04_034 crossref_primary_10_1016_j_tcs_2012_03_013 crossref_primary_10_1016_j_adhoc_2020_102084 crossref_primary_10_1016_j_disopt_2016_07_001 crossref_primary_10_1007_s11265_020_01550_1 crossref_primary_10_1016_j_eswa_2021_115185 crossref_primary_10_1016_j_jcss_2017_11_001 crossref_primary_10_1007_s10878_019_00421_1 crossref_primary_10_1007_s00224_018_9858_1 crossref_primary_10_1137_17M1154370 crossref_primary_10_1007_s00453_011_9575_5 crossref_primary_10_1007_s13278_012_0067_7 crossref_primary_10_1016_j_tcs_2017_05_042 crossref_primary_10_1016_j_tcs_2012_05_016 crossref_primary_10_1007_s00453_022_00938_8 crossref_primary_10_1137_20M1323369 crossref_primary_10_1007_s00453_012_9661_3 crossref_primary_10_1145_3519028 crossref_primary_10_1016_j_jcss_2017_05_003 crossref_primary_10_1007_s00224_021_10062_9 crossref_primary_10_1137_22M1513290 crossref_primary_10_1016_j_tcs_2014_10_035 crossref_primary_10_1007_s00224_019_09964_6 crossref_primary_10_1145_3633778 crossref_primary_10_1145_3395037 crossref_primary_10_1007_s00453_023_01144_w crossref_primary_10_1016_j_tcs_2018_05_004 crossref_primary_10_1016_j_tcs_2018_11_006 crossref_primary_10_1007_s11390_014_1474_1 crossref_primary_10_1016_j_jcss_2021_03_001 crossref_primary_10_1016_j_tcs_2023_114326 crossref_primary_10_1007_s00224_014_9557_5 crossref_primary_10_1016_j_orl_2016_03_008 crossref_primary_10_1016_j_jss_2019_05_032 crossref_primary_10_1007_s00453_018_0515_5 crossref_primary_10_1007_s10878_022_00966_8 crossref_primary_10_3390_a17020072 crossref_primary_10_1016_j_tcs_2012_05_031 crossref_primary_10_1016_j_tcs_2022_11_002 crossref_primary_10_1287_opre_2019_1970 crossref_primary_10_1016_j_ipl_2013_01_001 crossref_primary_10_1007_s00453_025_01303_1 crossref_primary_10_1145_3265027 crossref_primary_10_1007_s10458_020_09452_z crossref_primary_10_1007_s00453_023_01136_w crossref_primary_10_1007_s00453_024_01261_0 crossref_primary_10_1016_j_ic_2013_11_006 crossref_primary_10_1016_j_tcs_2022_03_021 crossref_primary_10_1007_s00224_014_9549_5 crossref_primary_10_1137_16M1104834 crossref_primary_10_1007_s13721_019_0193_5 crossref_primary_10_1016_j_tcs_2024_115029 crossref_primary_10_1109_TKDE_2021_3062318 crossref_primary_10_1007_s00521_022_07620_8 crossref_primary_10_3390_info13030141 |
| Cites_doi | 10.1016/j.dam.2007.03.023 10.1016/j.ipl.2004.10.003 10.1016/0196-6774(86)90032-5 10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K 10.1007/s00453-004-1145-7 10.1016/S0020-0190(00)00004-1 10.1006/jagm.2001.1186 10.1007/BF01580444 10.1016/j.dam.2007.03.026 10.1145/1552285.1552286 10.1016/S0022-0000(03)00075-8 10.1016/S0022-0000(03)00074-6 10.1137/0222038 10.1016/S0196-6774(03)00005-1 10.1006/jcss.2001.1774 10.1016/S0020-0190(97)00213-5 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS |
| Copyright_xml | – notice: 2015 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2010.06.026 |
| DatabaseName | CrossRef Pascal-Francis 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 Applied Sciences |
| EndPage | 3756 |
| ExternalDocumentID | 23263736 10_1016_j_tcs_2010_06_026 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9DU 9JN AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AEXQZ AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ YNT ZMT ZY4 ~G- ~HD AFXIZ AGCQF AGRNS BNPGV IQODW RIG SSH XJT 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c307t-b91f075e5a258b471aff6961a7fd0be37a109575a58cf186c3d4326cd29b890d3 |
| ISICitedReferencesCount | 256 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000281942400018&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 | Sun Sep 28 11:02:54 EDT 2025 Mon Jul 21 09:18:37 EDT 2025 Tue Nov 18 21:49:54 EST 2025 Sat Nov 29 05:15:03 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 40-42 |
| Keywords | Branching Vertex Upper bound Computer theory Branch-and-search Vertex cover NP complete problem Space time Parameterized algorithm NP-complete problem Uniformity Polynomial time |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c307t-b91f075e5a258b471aff6961a7fd0be37a109575a58cf186c3d4326cd29b890d3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 787189644 |
| PQPubID | 23500 |
| PageCount | 21 |
| ParticipantIDs | proquest_miscellaneous_787189644 pascalfrancis_primary_23263736 crossref_citationtrail_10_1016_j_tcs_2010_06_026 crossref_primary_10_1016_j_tcs_2010_06_026 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-09-06 |
| PublicationDateYYYYMMDD | 2010-09-06 |
| PublicationDate_xml | – month: 09 year: 2010 text: 2010-09-06 day: 06 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2010 |
| Publisher | Elsevier |
| Publisher_xml | – name: Elsevier |
| References | Downey (10.1016/j.tcs.2010.06.026_br000080) 1999 Nemhauser (10.1016/j.tcs.2010.06.026_br000130) 1975; 8 Downey (10.1016/j.tcs.2010.06.026_br000075) 1992; 87 10.1016/j.tcs.2010.06.026_br000165 Chen (10.1016/j.tcs.2010.06.026_br000050) 2005; 43 Niedermeier (10.1016/j.tcs.2010.06.026_br000140) 2000; 73 Cai (10.1016/j.tcs.2010.06.026_br000025) 2003; 67 Ebengger (10.1016/j.tcs.2010.06.026_br000085) 1984; 19 Chen (10.1016/j.tcs.2010.06.026_br000045) 2000; 35 Mathieson (10.1016/j.tcs.2010.06.026_br000125) 2004; vol. 3162 Balasubramanian (10.1016/j.tcs.2010.06.026_br000010) 1998; 65 (10.1016/j.tcs.2010.06.026_br000120) 1996; vol. 26 Niedermeier (10.1016/j.tcs.2010.06.026_br000145) 2003; 47 Robson (10.1016/j.tcs.2010.06.026_br000160) 1986; 7 Bar-Yehuda (10.1016/j.tcs.2010.06.026_br000015) 1985; 25 Prieto (10.1016/j.tcs.2010.06.026_br000155) 2004; vol. 3162 Dehne (10.1016/j.tcs.2010.06.026_br000065) 2004; vol. 3162 Fomin (10.1016/j.tcs.2010.06.026_br000105) 2005; vol. 3580 Fellows (10.1016/j.tcs.2010.06.026_br000095) 2004; vol. 3353 Cheetham (10.1016/j.tcs.2010.06.026_br000035) 2003; 67 Fellows (10.1016/j.tcs.2010.06.026_br000090) 2003; vol. 2880 Diestel (10.1016/j.tcs.2010.06.026_br000070) 1997; vol. 173 Woeginger (10.1016/j.tcs.2010.06.026_br000170) 2008; 156 Buss (10.1016/j.tcs.2010.06.026_br000020) 1993; 22 Chor (10.1016/j.tcs.2010.06.026_br000060) 2004; vol. 3353 Fomin (10.1016/j.tcs.2010.06.026_br000100) 2009; 56 Chlebik (10.1016/j.tcs.2010.06.026_br000055) 2008; 156 Garey (10.1016/j.tcs.2010.06.026_br000110) 1979 Prieto (10.1016/j.tcs.2010.06.026_br000150) 2003; vol. 2748 Niedermeier (10.1016/j.tcs.2010.06.026_br000135) 1999; vol. 1563 Chen (10.1016/j.tcs.2010.06.026_br000040) 2001; 41 Chandran (10.1016/j.tcs.2010.06.026_br000030) 2005; 93 10.1016/j.tcs.2010.06.026_br000005 Impagliazzo (10.1016/j.tcs.2010.06.026_br000115) 2001; 63 |
| References_xml | – volume: vol. 3353 start-page: 257 year: 2004 ident: 10.1016/j.tcs.2010.06.026_br000060 article-title: Linear kernels in linear time, or how to save k colors in O(n2) steps – volume: 156 start-page: 397 issue: 3 year: 2008 ident: 10.1016/j.tcs.2010.06.026_br000170 article-title: Open problems around exact algorithms publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2007.03.023 – volume: vol. 173 year: 1997 ident: 10.1016/j.tcs.2010.06.026_br000070 – volume: vol. 26 year: 1996 ident: 10.1016/j.tcs.2010.06.026_br000120 – volume: vol. 1563 start-page: 561 year: 1999 ident: 10.1016/j.tcs.2010.06.026_br000135 article-title: Upper bounds for vertex cover further improved – volume: 93 start-page: 125 issue: 3 year: 2005 ident: 10.1016/j.tcs.2010.06.026_br000030 article-title: Refined memorisation for vertex cover publication-title: Information Processing Letters doi: 10.1016/j.ipl.2004.10.003 – volume: 7 start-page: 425 year: 1986 ident: 10.1016/j.tcs.2010.06.026_br000160 article-title: Algorithms for maximum independent sets publication-title: Journal of Algorithms doi: 10.1016/0196-6774(86)90032-5 – volume: 35 start-page: 253 year: 2000 ident: 10.1016/j.tcs.2010.06.026_br000045 article-title: Improvement on vertex cover for low degree graphs publication-title: Networks doi: 10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K – volume: vol. 3162 start-page: 138 year: 2004 ident: 10.1016/j.tcs.2010.06.026_br000155 article-title: Looking at the stars – volume: 43 start-page: 245 issue: 4 year: 2005 ident: 10.1016/j.tcs.2010.06.026_br000050 article-title: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems publication-title: Algorithmica doi: 10.1007/s00453-004-1145-7 – volume: 25 start-page: 27 year: 1985 ident: 10.1016/j.tcs.2010.06.026_br000015 article-title: A local-ratio theorem for approximating the weighted vertex cover problem publication-title: Annals of Discrete Mathematics – year: 1979 ident: 10.1016/j.tcs.2010.06.026_br000110 – volume: vol. 3162 start-page: 127 year: 2004 ident: 10.1016/j.tcs.2010.06.026_br000125 article-title: Packing edge disjoint triangles: A parameterized view – volume: vol. 3580 start-page: 191 year: 2005 ident: 10.1016/j.tcs.2010.06.026_br000105 article-title: Measure and conquer: Domination — a case study – volume: 73 start-page: 125 issue: 3–4 year: 2000 ident: 10.1016/j.tcs.2010.06.026_br000140 article-title: A general method to speed up fixed-parameter-tractable algorithms publication-title: Information Processing Letters doi: 10.1016/S0020-0190(00)00004-1 – volume: 41 start-page: 280 year: 2001 ident: 10.1016/j.tcs.2010.06.026_br000040 article-title: Vertex cover: further observations and further improvements publication-title: Journal of Algorithms doi: 10.1006/jagm.2001.1186 – volume: 8 start-page: 232 year: 1975 ident: 10.1016/j.tcs.2010.06.026_br000130 article-title: Vertex packings: structural properties and algorithms publication-title: Mathematical Programming doi: 10.1007/BF01580444 – volume: vol. 2748 start-page: 474 year: 2003 ident: 10.1016/j.tcs.2010.06.026_br000150 article-title: Either/or: Using vertex cover structure in designing FPT-algorithms — the case of k-internal spanning tree – volume: 156 start-page: 292 year: 2008 ident: 10.1016/j.tcs.2010.06.026_br000055 article-title: Crown reductions for the minimum weighted vertex cover problem publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2007.03.026 – volume: 56 start-page: 1 issue: 5 year: 2009 ident: 10.1016/j.tcs.2010.06.026_br000100 article-title: A measure & conquer approach for the analysis of exact algorithms publication-title: J. ACM doi: 10.1145/1552285.1552286 – volume: 67 start-page: 691 issue: 4 year: 2003 ident: 10.1016/j.tcs.2010.06.026_br000035 article-title: Solving large FPT problems on coarse grained parallel machines publication-title: Journal of Computer and System Sciences doi: 10.1016/S0022-0000(03)00075-8 – volume: 67 start-page: 789 issue: 4 year: 2003 ident: 10.1016/j.tcs.2010.06.026_br000025 article-title: On the existence of subexponential parameterized algorithms publication-title: Journal of Computer and System Sciences doi: 10.1016/S0022-0000(03)00074-6 – volume: 87 start-page: 161 year: 1992 ident: 10.1016/j.tcs.2010.06.026_br000075 article-title: Fixed-parameter tractability and completeness publication-title: Congressus Numerantium – volume: 22 start-page: 560 year: 1993 ident: 10.1016/j.tcs.2010.06.026_br000020 article-title: Nondeterminism within P publication-title: SIAM Journal on Computing doi: 10.1137/0222038 – year: 1999 ident: 10.1016/j.tcs.2010.06.026_br000080 – volume: 47 start-page: 63 year: 2003 ident: 10.1016/j.tcs.2010.06.026_br000145 article-title: On efficient fixed-parameter algorithms for weighted vertex cover publication-title: Journal of Algorithms doi: 10.1016/S0196-6774(03)00005-1 – ident: 10.1016/j.tcs.2010.06.026_br000165 – ident: 10.1016/j.tcs.2010.06.026_br000005 – volume: 19 start-page: 83 year: 1984 ident: 10.1016/j.tcs.2010.06.026_br000085 article-title: Pseudo-Boolean functions and stability of graphs publication-title: Annals of Discrete Mathematics – volume: vol. 2880 start-page: 1 year: 2003 ident: 10.1016/j.tcs.2010.06.026_br000090 article-title: Blow-ups, win/win’s and crown rules: some new directions in FPT – volume: vol. 3162 start-page: 271 year: 2004 ident: 10.1016/j.tcs.2010.06.026_br000065 article-title: Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover – volume: 63 start-page: 512 year: 2001 ident: 10.1016/j.tcs.2010.06.026_br000115 article-title: Which problems have strongly exponential complexity? publication-title: Journal of Computer and System Sciences doi: 10.1006/jcss.2001.1774 – volume: vol. 3353 start-page: 235 year: 2004 ident: 10.1016/j.tcs.2010.06.026_br000095 article-title: Finding k disjoint triangles in an arbitrary graph – volume: 65 start-page: 163 year: 1998 ident: 10.1016/j.tcs.2010.06.026_br000010 article-title: An improved fixed parameter algorithm for Vertex cover publication-title: Information Processing Letters doi: 10.1016/S0020-0190(97)00213-5 |
| SSID | ssj0000576 |
| Score | 2.4871497 |
| Snippet | This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time... |
| SourceID | proquest pascalfrancis crossref |
| SourceType | Aggregation Database Index Database Enrichment Source |
| StartPage | 3736 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences C (programming language) Computer science; control theory; systems Exact sciences and technology Folding Miscellaneous Theoretical computing Upper bounds Variability |
| Title | Improved upper bounds for vertex cover |
| URI | https://www.proquest.com/docview/787189644 |
| Volume | 411 |
| WOSCitedRecordID | wos000281942400018&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 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 customDbUrl: isFulltext: true dateEnd: 20180131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg48CE-BggysfkA-JAlCp2En8cKzRgICYOReotsh1HYkJZ1LRT-e95ju202wCxA5cosmK39fv1vRe_jx9Cr13xJbW2SZkmIi2oJqkynKRMSVuWinLD9UA2wU9PxWIhvwaWzn6gE-BtKzYb2f1XUcMYCNuVzt5A3OOiMAD3IHS4gtjh-k-C98cE4Eeuu84uE-14k4amC4mjXrabxLiszV2ndL5TzGgCy0MSTOM2_B-qOABO24Tez6odoj8nP1WdzKZxeOEzcD_Y3TMFFw53rQh2VE_u4iXSc5pEPVkEregBUWSpb4sVNF_uSwiiFc257xd-TUP7w4Kz6cr0IbGOTTP6m27YV6zUmDsY09LOKliicktULjWPstton_JSgmrbn50cLz5tDXLJfcg6_KgY3B7S_K58j0vuyb1O9bD1jac4uWatBxdk_hDdD-8OeOZl_gjdsu0hehB5OXBQ04fo4MvYi7d_jN5EQOABENgDAgMgsAcEHgDxBH17fzx_9zEN7BipAb28SrUkDfh7Fv5QpdDgY6imYZIRxZs60zbnioD7zEtVCtMQwUxeF-Crm5pKLWRW50_RXnve2mcIN5YxmEUapk1RSKqVFEzVhCohVWHoBGVxUyoTWsc7BpMf1R-FMUFvxymd75vyt4ePLu30OAPcfeaANUE4bn0F6s_FtADs5-u-AntDhASn_vlNPvAFuruF_Uu0t1qu7St0x1ysvvfLo4CfX48KecQ |
| 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+upper+bounds+for+vertex+cover&rft.jtitle=Theoretical+computer+science&rft.au=Chen%2C+Jianer&rft.au=Kanj%2C+Iyad+A.&rft.au=Xia%2C+Ge&rft.date=2010-09-06&rft.issn=0304-3975&rft.volume=411&rft.issue=40-42&rft.spage=3736&rft.epage=3756&rft_id=info:doi/10.1016%2Fj.tcs.2010.06.026&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2010_06_026 |
| 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 |