p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
We introduce and study two natural generalizations of the Connected Vertex Cover (VC) problem: the p-Edge-Connected and p-Vertex-Connected VC problem (where p≥2 is a fixed integer). We obtain an 2O(pk)nO(1)-time algorithm for p-Edge-Connected VC and an 2O(k2)nO(1)-time algorithm for p-Vertex-Connect...
Gespeichert in:
| Veröffentlicht in: | Journal of computer and system sciences Jg. 133; S. 23 - 40 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.05.2023
|
| Schlagworte: | |
| ISSN: | 0022-0000, 1090-2724 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We introduce and study two natural generalizations of the Connected Vertex Cover (VC) problem: the p-Edge-Connected and p-Vertex-Connected VC problem (where p≥2 is a fixed integer). We obtain an 2O(pk)nO(1)-time algorithm for p-Edge-Connected VC and an 2O(k2)nO(1)-time algorithm for p-Vertex-Connected VC. Thus, like Connected VC, both constrained VC problems are FPT. Furthermore, like Connected VC, neither problem admits a polynomial kernel unless NP ⊆ coNP/poly, which is highly unlikely. We prove however that both problems admit time efficient polynomial sized approximate kernelization schemes. Finally, we describe a 2(p+1)-approximation algorithm for the p-Edge-Connected VC. The proofs for the new VC problems require more sophisticated arguments than for Connected VC. In particular, for the approximation algorithm we use Gomory-Hu trees and for the approximate kernels a result on small-size spanning p-vertex/edge-connected subgraphs of a p-vertex/edge-connected graph by Nishizeki and Poljak (1994) [30] and Nagamochi and Ibaraki (1992) [27]. |
|---|---|
| AbstractList | We introduce and study two natural generalizations of the Connected Vertex Cover (VC) problem: the p-Edge-Connected and p-Vertex-Connected VC problem (where p≥2 is a fixed integer). We obtain an 2O(pk)nO(1)-time algorithm for p-Edge-Connected VC and an 2O(k2)nO(1)-time algorithm for p-Vertex-Connected VC. Thus, like Connected VC, both constrained VC problems are FPT. Furthermore, like Connected VC, neither problem admits a polynomial kernel unless NP ⊆ coNP/poly, which is highly unlikely. We prove however that both problems admit time efficient polynomial sized approximate kernelization schemes. Finally, we describe a 2(p+1)-approximation algorithm for the p-Edge-Connected VC. The proofs for the new VC problems require more sophisticated arguments than for Connected VC. In particular, for the approximation algorithm we use Gomory-Hu trees and for the approximate kernels a result on small-size spanning p-vertex/edge-connected subgraphs of a p-vertex/edge-connected graph by Nishizeki and Poljak (1994) [30] and Nagamochi and Ibaraki (1992) [27]. |
| Author | Majumdar, Diptapriyo Gutin, Gregory Jansen, Bart M.P. Wahlström, Magnus Einarson, Carl |
| Author_xml | – sequence: 1 givenname: Carl orcidid: 0000-0002-2814-7018 surname: Einarson fullname: Einarson, Carl email: einarsoncarl@gmail.com organization: Royal Holloway, University of London, Egham, United Kingdom – sequence: 2 givenname: Gregory surname: Gutin fullname: Gutin, Gregory email: g.gutin@rhul.ac.uk organization: Royal Holloway, University of London, Egham, United Kingdom – sequence: 3 givenname: Bart M.P. orcidid: 0000-0001-8204-1268 surname: Jansen fullname: Jansen, Bart M.P. email: b.m.p.jansen@tue.nl organization: Eindhoven University of Technology, the Netherlands – sequence: 4 givenname: Diptapriyo orcidid: 0000-0003-2677-4648 surname: Majumdar fullname: Majumdar, Diptapriyo email: diptapriyo@iiitd.ac.in organization: Indraprastha Institute of Information Technology Delhi, New Delhi, India – sequence: 5 givenname: Magnus orcidid: 0000-0002-0933-4504 surname: Wahlström fullname: Wahlström, Magnus email: magnus.wahlstrom@rhul.ac.uk organization: Royal Holloway, University of London, Egham, United Kingdom |
| BookMark | eNp9kMtqAzEMRU1JoUnaH-hqfsATyfPKlG5KSB8QaBbt2hhbk3pI7MEeQtqvr0O6rkBISFxxdWZs4rwjxu4RcgSsF33e6xhzAULkiDmAuGJThBa4aEQ5YdM0ERxS3LBZjD0AYlUXU7Yd-NrsaHGkMNKJa-8c6ZFMdhlk2qfmIduqoA40UrA_aadcymEI_mQParTeZWq_88GOX4d4y647tY9091fn7PN5_bF65Zv3l7fV04Zr0VYjb5bKtK0CIqiL0jQoYNl1jcLGlNgWBkuh6q6qStKtUGhg2RKoqtQCDalKF3MmLnd18DEG6uQQkpvwLRHkmYns5ZmJPDORiDIRSKLHi4iSs6OlIKO25DQZG9Lb0nj7n_wXFMFtwA |
| Cites_doi | 10.1137/18M1209489 10.1016/j.tcs.2011.04.039 10.1016/0020-0190(82)90022-9 10.1137/18M1172508 10.1007/978-1-4471-5559-1 10.1137/0109047 10.1007/s10878-014-9783-4 10.1145/2886094 10.1016/j.tcs.2009.07.027 10.1007/BF01580444 10.1007/BF01758778 10.1007/s00224-017-9837-y 10.1007/s00453-020-00708-4 10.1007/s00453-022-00935-x 10.1145/2650261 10.1145/3170444 10.1145/3470869 10.1016/j.jcss.2019.05.001 10.1016/j.jcss.2021.07.006 10.1007/s00224-018-9892-z 10.1016/0166-218X(94)90015-9 10.1006/jagm.2001.1186 10.1007/s00224-007-9089-3 |
| ContentType | Journal Article |
| Copyright | 2022 The Author(s) |
| Copyright_xml | – notice: 2022 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jcss.2022.11.002 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 40 |
| ExternalDocumentID | 10_1016_j_jcss_2022_11_002 S0022000022000824 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c295t-78ad99a0ee0634d71208ff7a17d4193d142a6f554ec92a1d089e0a54c21dea5c3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000911110800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sat Nov 29 04:16:30 EST 2025 Fri Feb 23 02:39:47 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Kernels Vertex cover Connectivity Approximation algorithms Approximate kernels Parameterized algorithms |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c295t-78ad99a0ee0634d71208ff7a17d4193d142a6f554ec92a1d089e0a54c21dea5c3 |
| ORCID | 0000-0003-2677-4648 0000-0001-8204-1268 0000-0002-2814-7018 0000-0002-0933-4504 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2022.11.002 |
| PageCount | 18 |
| ParticipantIDs | crossref_primary_10_1016_j_jcss_2022_11_002 elsevier_sciencedirect_doi_10_1016_j_jcss_2022_11_002 |
| PublicationCentury | 2000 |
| PublicationDate | May 2023 2023-05-00 |
| PublicationDateYYYYMMDD | 2023-05-01 |
| PublicationDate_xml | – month: 05 year: 2023 text: May 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Agrawal, Misra, Panolan, Saurabh (br0020) 2017; vol. 10389 Downey, Fellows (br0100) 2013 Krithika, Majumdar, Raman (br0190) 2018; 62 Agrawal, Saurabh, Tale (br0030) 2019; 63 West (br0380) 1996 Dom, Lokshtanov, Saurabh (br0090) 2014; 11 Ramanujan (br0360) 2019 Oxley (br0350) 2011 Nutov (br0330) 2022; 84 Abhinav, Bandopadhyay, Banik, Saurabh (br0010) 2022; vol. 13296 Nishizeki, Poljak (br0300) 1994; 55 Eiben, Hermelin, Ramanujan (br0120) 2019; 105 Nagamochi, Ibaraki (br0270) 1992; 7 Cygan (br0070) 2012 Jansen, Wlodarczyk (br0180) 2022 Dvorák, Emil Feldmann, Knop, Masarík, Toufar, Veselý (br0110) 2021; 35 Lokshtanov, Panolan, Ramanujan, Saurabh (br0220) 2017 Nutov (br0340) 2022 Eiben, Kumar, Mouawad, Panolan, Siebertz (br0130) 2019; 33 Fomin, Lokshtanov, Panolan, Saurabh (br0140) 2016; 63 Bandyapadhyay, Fomin, Golovach, Purohit, Simonov (br0040) 2021 Chen, Kanj, Jia (br0060) 2001; 41 Majumdar, Ramanujan, Saurabh (br0230) 2020; 82 Manurangsi (br0240) 2018; vol. 69 Lokshtanov, Misra, Panolan, Saurabh (br0210) 2018; 14 Nemhauser, Trotter (br0280) 1975; 8 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0080) 2015 Marx (br0250) 2009; 410 Niedermeier (br0290) 2006 Nutov (br0310) 2020; vol. 12806 Bodlaender, Thomassé, Yeo (br0050) 2011; 412 Gomory, Hu (br0160) 1961; 9 Savage (br0370) 1982; 14 Fomin, Lokshtanov, Saurabh, Zehavi (br0150) 2019 Nutov (br0320) 2022; 123 Gunda, Jain, Lokshtanov, Saurabh, Tale (br0170) 2021; 13 Mölle, Richter, Rossmanith (br0260) 2008; 43 Li, Yang, Wu (br0200) 2016; 31 Agrawal (10.1016/j.jcss.2022.11.002_br0020) 2017; vol. 10389 West (10.1016/j.jcss.2022.11.002_br0380) 1996 Lokshtanov (10.1016/j.jcss.2022.11.002_br0210) 2018; 14 Oxley (10.1016/j.jcss.2022.11.002_br0350) 2011 Dom (10.1016/j.jcss.2022.11.002_br0090) 2014; 11 Fomin (10.1016/j.jcss.2022.11.002_br0140) 2016; 63 Majumdar (10.1016/j.jcss.2022.11.002_br0230) 2020; 82 Bodlaender (10.1016/j.jcss.2022.11.002_br0050) 2011; 412 Jansen (10.1016/j.jcss.2022.11.002_br0180) Niedermeier (10.1016/j.jcss.2022.11.002_br0290) 2006 Nutov (10.1016/j.jcss.2022.11.002_br0310) 2020; vol. 12806 Lokshtanov (10.1016/j.jcss.2022.11.002_br0220) 2017 Cygan (10.1016/j.jcss.2022.11.002_br0070) 2012 Eiben (10.1016/j.jcss.2022.11.002_br0120) 2019; 105 Bandyapadhyay (10.1016/j.jcss.2022.11.002_br0040) Savage (10.1016/j.jcss.2022.11.002_br0370) 1982; 14 Cygan (10.1016/j.jcss.2022.11.002_br0080) 2015 Nemhauser (10.1016/j.jcss.2022.11.002_br0280) 1975; 8 Abhinav (10.1016/j.jcss.2022.11.002_br0010) 2022; vol. 13296 Manurangsi (10.1016/j.jcss.2022.11.002_br0240) 2018; vol. 69 Nutov (10.1016/j.jcss.2022.11.002_br0330) 2022; 84 Li (10.1016/j.jcss.2022.11.002_br0200) 2016; 31 Eiben (10.1016/j.jcss.2022.11.002_br0130) 2019; 33 Mölle (10.1016/j.jcss.2022.11.002_br0260) 2008; 43 Ramanujan (10.1016/j.jcss.2022.11.002_br0360) 2019 Gunda (10.1016/j.jcss.2022.11.002_br0170) 2021; 13 Downey (10.1016/j.jcss.2022.11.002_br0100) 2013 Gomory (10.1016/j.jcss.2022.11.002_br0160) 1961; 9 Nishizeki (10.1016/j.jcss.2022.11.002_br0300) 1994; 55 Nutov (10.1016/j.jcss.2022.11.002_br0320) 2022; 123 Krithika (10.1016/j.jcss.2022.11.002_br0190) 2018; 62 Nagamochi (10.1016/j.jcss.2022.11.002_br0270) 1992; 7 Fomin (10.1016/j.jcss.2022.11.002_br0150) 2019 Marx (10.1016/j.jcss.2022.11.002_br0250) 2009; 410 Agrawal (10.1016/j.jcss.2022.11.002_br0030) 2019; 63 Dvorák (10.1016/j.jcss.2022.11.002_br0110) 2021; 35 Chen (10.1016/j.jcss.2022.11.002_br0060) 2001; 41 Nutov (10.1016/j.jcss.2022.11.002_br0340) |
| References_xml | – volume: vol. 10389 start-page: 25 year: 2017 end-page: 36 ident: br0020 article-title: Fast exact algorithms for survivable network design with uniform requirements publication-title: WADS – volume: 35 start-page: 546 year: 2021 end-page: 574 ident: br0110 article-title: Parameterized approximation schemes for Steiner trees with small number of Steiner vertices publication-title: SIAM J. Discrete Math. – volume: 410 start-page: 4471 year: 2009 end-page: 4479 ident: br0250 article-title: A parameterized view on matroid optimization problems publication-title: Theor. Comput. Sci. – volume: 9 year: 1961 ident: br0160 article-title: Multi-terminal network flows publication-title: J. Soc. Ind. Appl. Math. – year: 2022 ident: br0180 article-title: Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion – start-page: 77:1 year: 2019 end-page: 77:14 ident: br0360 article-title: An approximate kernel for connected feedback vertex set publication-title: Proceedings of ESA 2019 – volume: 63 start-page: 29:1 year: 2016 end-page: 29:60 ident: br0140 article-title: Efficient computation of representative families with applications in parameterized and exact algorithms publication-title: J. ACM – volume: 63 start-page: 587 year: 2019 end-page: 614 ident: br0030 article-title: On the parameterized complexity of contraction to generalization of trees publication-title: Theory Comput. Syst. – volume: 33 start-page: 1743 year: 2019 end-page: 1771 ident: br0130 article-title: Lossy kernels for connected dominating set on sparse graphs publication-title: SIAM J. Discrete Math. – year: 2011 ident: br0350 article-title: Matroid Theory – volume: 14 start-page: 14:1 year: 2018 end-page: 14:20 ident: br0210 article-title: Deterministic truncation of linear matroids publication-title: ACM Trans. Algorithms – volume: 55 start-page: 295 year: 1994 end-page: 301 ident: br0300 article-title: k-Connectivity and decomposition of graphs into forests publication-title: Discrete Appl. Math. – volume: 41 start-page: 280 year: 2001 end-page: 301 ident: br0060 article-title: Vertex cover: further observations and further improvements publication-title: J. Algorithms – year: 2022 ident: br0340 article-title: Parameterized algorithms for node connectivity augmentation problems – volume: 62 start-page: 1690 year: 2018 end-page: 1714 ident: br0190 article-title: Revisiting connected vertex cover: FPT algorithms and lossy kernels publication-title: Theory Comput. Syst. – year: 2015 ident: br0080 article-title: Parameterized Algorithms – start-page: 224 year: 2017 end-page: 237 ident: br0220 article-title: Lossy kernelization publication-title: Proceedings of STOC 2017 – volume: 105 start-page: 158 year: 2019 end-page: 170 ident: br0120 article-title: On approximate preprocessing for domination and hitting subgraphs with connected deletion sets publication-title: J. Comput. Syst. Sci. – volume: 123 start-page: 64 year: 2022 end-page: 75 ident: br0320 article-title: A 4-approximation for k-connected subgraphs publication-title: J. Comput. Syst. Sci. – year: 2021 ident: br0040 article-title: Lossy kernelization of same-size clustering – volume: 8 start-page: 232 year: 1975 end-page: 248 ident: br0280 article-title: Vertex packings: structural properties and algorithms publication-title: Math. Program. – year: 2019 ident: br0150 article-title: Kernelization: Theory of Parameterized Preprocessing – volume: 412 start-page: 4570 year: 2011 end-page: 4578 ident: br0050 article-title: Kernel bounds for disjoint cycles and disjoint paths publication-title: Theor. Comput. Sci. – volume: 11 start-page: 13:1 year: 2014 end-page: 13:20 ident: br0090 article-title: Kernelization lower bounds through colors and IDs publication-title: ACM Trans. Algorithms – volume: 43 start-page: 234 year: 2008 end-page: 253 ident: br0260 article-title: Enumerate and expand: improved algorithms for connected vertex cover and tree cover publication-title: Theory Comput. Syst. – volume: 14 start-page: 233 year: 1982 end-page: 235 ident: br0370 article-title: Depth-first search and the vertex cover problem publication-title: Inf. Process. Lett. – year: 1996 ident: br0380 article-title: Introduction to Graph Theory – volume: 13 start-page: 27:1 year: 2021 end-page: 27:40 ident: br0170 article-title: On the parameterized approximability of contraction to classes of chordal graphs publication-title: ACM Trans. Comput. Theory – volume: 82 start-page: 2902 year: 2020 end-page: 2926 ident: br0230 article-title: On the approximate compressibility of connected vertex cover publication-title: Algorithmica – start-page: 95 year: 2012 end-page: 106 ident: br0070 article-title: Deterministic parameterized connected vertex cover publication-title: Proceedings of SWAT 2012 – year: 2013 ident: br0100 article-title: Fundamentals of Parameterized Complexity publication-title: Texts in Computer Science – volume: vol. 69 start-page: 15:1 year: 2018 end-page: 15:21 ident: br0240 article-title: A note on max publication-title: 2nd Symposium on Simplicity in Algorithms (SOSA 2019) – volume: 7 start-page: 583 year: 1992 end-page: 596 ident: br0270 article-title: A linear-time algorithm for finding a sparse publication-title: Algorithmica – volume: vol. 13296 start-page: 1 year: 2022 end-page: 16 ident: br0010 article-title: Parameterized algorithms for finding highly connected solution publication-title: Computer Science – Theory and Applications. CSR – volume: vol. 12806 start-page: 220 year: 2020 end-page: 235 ident: br0310 article-title: 2-Node-connectivity network design publication-title: Proceedings of WAOA 2020 – volume: 31 start-page: 713 year: 2016 end-page: 724 ident: br0200 article-title: 2-edge connected dominating sets and 2-connected dominating sets of a graph publication-title: J. Comb. Optim. – year: 2006 ident: br0290 article-title: Invitation to Fixed-Parameter Algorithms – volume: 84 start-page: 1511 year: 2022 end-page: 1525 ident: br0330 article-title: Approximating publication-title: Algorithmica – volume: vol. 69 start-page: 15:1 year: 2018 ident: 10.1016/j.jcss.2022.11.002_br0240 article-title: A note on max k-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation – volume: 35 start-page: 546 issue: 1 year: 2021 ident: 10.1016/j.jcss.2022.11.002_br0110 article-title: Parameterized approximation schemes for Steiner trees with small number of Steiner vertices publication-title: SIAM J. Discrete Math. doi: 10.1137/18M1209489 – volume: 412 start-page: 4570 issue: 35 year: 2011 ident: 10.1016/j.jcss.2022.11.002_br0050 article-title: Kernel bounds for disjoint cycles and disjoint paths publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2011.04.039 – volume: 14 start-page: 233 issue: 5 year: 1982 ident: 10.1016/j.jcss.2022.11.002_br0370 article-title: Depth-first search and the vertex cover problem publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(82)90022-9 – volume: 33 start-page: 1743 issue: 3 year: 2019 ident: 10.1016/j.jcss.2022.11.002_br0130 article-title: Lossy kernels for connected dominating set on sparse graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/18M1172508 – year: 2013 ident: 10.1016/j.jcss.2022.11.002_br0100 article-title: Fundamentals of Parameterized Complexity doi: 10.1007/978-1-4471-5559-1 – volume: 9 year: 1961 ident: 10.1016/j.jcss.2022.11.002_br0160 article-title: Multi-terminal network flows publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0109047 – volume: 31 start-page: 713 issue: 2 year: 2016 ident: 10.1016/j.jcss.2022.11.002_br0200 article-title: 2-edge connected dominating sets and 2-connected dominating sets of a graph publication-title: J. Comb. Optim. doi: 10.1007/s10878-014-9783-4 – year: 1996 ident: 10.1016/j.jcss.2022.11.002_br0380 – year: 2015 ident: 10.1016/j.jcss.2022.11.002_br0080 – year: 2006 ident: 10.1016/j.jcss.2022.11.002_br0290 – volume: 63 start-page: 29:1 issue: 4 year: 2016 ident: 10.1016/j.jcss.2022.11.002_br0140 article-title: Efficient computation of representative families with applications in parameterized and exact algorithms publication-title: J. ACM doi: 10.1145/2886094 – volume: 410 start-page: 4471 issue: 44 year: 2009 ident: 10.1016/j.jcss.2022.11.002_br0250 article-title: A parameterized view on matroid optimization problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.07.027 – volume: 8 start-page: 232 issue: 1 year: 1975 ident: 10.1016/j.jcss.2022.11.002_br0280 article-title: Vertex packings: structural properties and algorithms publication-title: Math. Program. doi: 10.1007/BF01580444 – year: 2011 ident: 10.1016/j.jcss.2022.11.002_br0350 – volume: 7 start-page: 583 year: 1992 ident: 10.1016/j.jcss.2022.11.002_br0270 article-title: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph publication-title: Algorithmica doi: 10.1007/BF01758778 – volume: 62 start-page: 1690 issue: 8 year: 2018 ident: 10.1016/j.jcss.2022.11.002_br0190 article-title: Revisiting connected vertex cover: FPT algorithms and lossy kernels publication-title: Theory Comput. Syst. doi: 10.1007/s00224-017-9837-y – volume: 82 start-page: 2902 issue: 10 year: 2020 ident: 10.1016/j.jcss.2022.11.002_br0230 article-title: On the approximate compressibility of connected vertex cover publication-title: Algorithmica doi: 10.1007/s00453-020-00708-4 – year: 2019 ident: 10.1016/j.jcss.2022.11.002_br0150 – ident: 10.1016/j.jcss.2022.11.002_br0340 – volume: 84 start-page: 1511 issue: 6 year: 2022 ident: 10.1016/j.jcss.2022.11.002_br0330 article-title: Approximating k-connected m-dominating sets publication-title: Algorithmica doi: 10.1007/s00453-022-00935-x – volume: 11 start-page: 13:1 issue: 2 year: 2014 ident: 10.1016/j.jcss.2022.11.002_br0090 article-title: Kernelization lower bounds through colors and IDs publication-title: ACM Trans. Algorithms doi: 10.1145/2650261 – volume: 14 start-page: 14:1 issue: 2 year: 2018 ident: 10.1016/j.jcss.2022.11.002_br0210 article-title: Deterministic truncation of linear matroids publication-title: ACM Trans. Algorithms doi: 10.1145/3170444 – volume: 13 start-page: 27:1 issue: 4 year: 2021 ident: 10.1016/j.jcss.2022.11.002_br0170 article-title: On the parameterized approximability of contraction to classes of chordal graphs publication-title: ACM Trans. Comput. Theory doi: 10.1145/3470869 – volume: 105 start-page: 158 year: 2019 ident: 10.1016/j.jcss.2022.11.002_br0120 article-title: On approximate preprocessing for domination and hitting subgraphs with connected deletion sets publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2019.05.001 – volume: 123 start-page: 64 year: 2022 ident: 10.1016/j.jcss.2022.11.002_br0320 article-title: A 4-approximation for k-connected subgraphs publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2021.07.006 – volume: vol. 12806 start-page: 220 year: 2020 ident: 10.1016/j.jcss.2022.11.002_br0310 article-title: 2-Node-connectivity network design – volume: 63 start-page: 587 issue: 3 year: 2019 ident: 10.1016/j.jcss.2022.11.002_br0030 article-title: On the parameterized complexity of contraction to generalization of trees publication-title: Theory Comput. Syst. doi: 10.1007/s00224-018-9892-z – start-page: 77:1 year: 2019 ident: 10.1016/j.jcss.2022.11.002_br0360 article-title: An approximate kernel for connected feedback vertex set – ident: 10.1016/j.jcss.2022.11.002_br0040 – ident: 10.1016/j.jcss.2022.11.002_br0180 – start-page: 95 year: 2012 ident: 10.1016/j.jcss.2022.11.002_br0070 article-title: Deterministic parameterized connected vertex cover – volume: 55 start-page: 295 issue: 3 year: 1994 ident: 10.1016/j.jcss.2022.11.002_br0300 article-title: k-Connectivity and decomposition of graphs into forests publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(94)90015-9 – volume: 41 start-page: 280 issue: 2 year: 2001 ident: 10.1016/j.jcss.2022.11.002_br0060 article-title: Vertex cover: further observations and further improvements publication-title: J. Algorithms doi: 10.1006/jagm.2001.1186 – volume: vol. 13296 start-page: 1 year: 2022 ident: 10.1016/j.jcss.2022.11.002_br0010 article-title: Parameterized algorithms for finding highly connected solution – start-page: 224 year: 2017 ident: 10.1016/j.jcss.2022.11.002_br0220 article-title: Lossy kernelization – volume: 43 start-page: 234 issue: 2 year: 2008 ident: 10.1016/j.jcss.2022.11.002_br0260 article-title: Enumerate and expand: improved algorithms for connected vertex cover and tree cover publication-title: Theory Comput. Syst. doi: 10.1007/s00224-007-9089-3 – volume: vol. 10389 start-page: 25 year: 2017 ident: 10.1016/j.jcss.2022.11.002_br0020 article-title: Fast exact algorithms for survivable network design with uniform requirements |
| SSID | ssj0011563 |
| Score | 2.3762028 |
| Snippet | We introduce and study two natural generalizations of the Connected Vertex Cover (VC) problem: the p-Edge-Connected and p-Vertex-Connected VC problem (where... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 23 |
| SubjectTerms | Approximate kernels Approximation algorithms Connectivity Kernels Parameterized algorithms Vertex cover |
| Title | p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms |
| URI | https://dx.doi.org/10.1016/j.jcss.2022.11.002 |
| Volume | 133 |
| WOSCitedRecordID | wos000911110800001&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: ScienceDirect database customDbUrl: eissn: 1090-2724 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 20211214 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLeqjQMcGAwQ40s-cItcUiepY27d6PiQmHoYUm-RYzus1UirrJ26_R_7f_cc203aAWIHLlFlKc7H-_W9n533fg-h95Gk4BmTkGgl-yTONSU50GLS53lRxFQUqZJ1swl2cpKOx3zU6dz4WpjLc1aW6WrF5__V1DAGxjals_cw93pSGIDfYHQ4gtnh-E-Gn5Nh3S_92HRa1isiTSqLNMTSDgSyztqMBsAeTWaWEWu-1sqqthqF8dXEljMG4vznrJoszpyg-V0KK11LiPpcqwkduJDaUHVT8OvKuo5EtU7o-Lx08gW-Ssan8ojSbQodwsMF37ujbrNrPl3-UjYj_BP4OjGvJlez9r4FbWUJtuoITLjc8MVR1PamUSsuW1WnOx7fbj5Mu1N5YdTXKe0aUdaQNvHNf9PfCnvrZESf5zbNzByZmQPWRVktUbpLWcLB3-8Ovg7H39afp2DRG3kZevMIrhrLJg5u38nvGU-LxZw-QY-d7fDAwuYp6uhyH-351h7Yefp99KilU_kMjSymPmwjCtsBXCPqI97AEwZM4A084QZPz9GP4-Hp0RfiWnEQSXmyICwVinMRag2UNlasR8O0KJjoMRXDEkD14G_dL4Caasmp6Kkw5ToUSQyeQGmRyOgF2ilnpX6JsC6AUzPdz6mUccxSLpJQAE9iRSSKPNEHKPCvK5tbxZXszyY6QIl_o5kDuOWCGQDkL-e9utdVXqOHDYTfoJ1FtdRv0QN5uZhcVO8cOm4BOhOREg |
| 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=p-Edge%2Fvertex-connected+vertex+cover%3A+Parameterized+and+approximation+algorithms&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Einarson%2C+Carl&rft.au=Gutin%2C+Gregory&rft.au=Jansen%2C+Bart+M.P.&rft.au=Majumdar%2C+Diptapriyo&rft.date=2023-05-01&rft.issn=0022-0000&rft.volume=133&rft.spage=23&rft.epage=40&rft_id=info:doi/10.1016%2Fj.jcss.2022.11.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jcss_2022_11_002 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |