On the complexity of a problem related to Set Cover
Uložené v:
| Vydané v: | Theoretical computer science s. 115644 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
01.11.2025
|
| ISSN: | 0304-3975 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| ArticleNumber | 115644 |
|---|---|
| Author | Shitov, Yaroslav |
| Author_xml | – sequence: 1 givenname: Yaroslav surname: Shitov fullname: Shitov, Yaroslav |
| BookMark | eNotz8lqwzAUhWEtEmiS9gG60wvY1bUGN8tiOgQCWSR7oeGKxtiWkURp3r4J6dn8uwPfmiymOCEhz8BqYKBe-rq4XDeskTWAVEIsyIpxJiq-beUDWefcs-tkq1aEHyZavpG6OM4D_p7LhcZADZ1TtAOONOFgCnpaIj1ioV38wfRIlsEMGZ_-uyGnj_dT91XtD5-77m1fua0QlVHWg2y4h5Y5tIG3ApQE31puFcdgvbROYvDBe2dBSKsAfGOleRWGIeMbAvdbl2LOCYOe03k06aKB6RtU9_oK1TeovkP5H73IS0U |
| Cites_doi | 10.1016/j.tcs.2024.114936 10.1145/322077.322090 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2025.115644 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2025_115644 |
| 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 |
| ID | FETCH-LOGICAL-c944-a6bd1523d170cebf3741651d7b3b63efbd5bc5efdfddcb145b611d2b5a84a0e03 |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 06:52:08 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c944-a6bd1523d170cebf3741651d7b3b63efbd5bc5efdfddcb145b611d2b5a84a0e03 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2025_115644 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-11-00 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: 2025-11-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2025 |
| References | Garey (10.1016/j.tcs.2025.115644_bib0003) 1979 Benoist (10.1016/j.tcs.2025.115644_bib0001) 2025; 1024 Garey (10.1016/j.tcs.2025.115644_bib0002) 1978; 25 |
| References_xml | – year: 1979 ident: 10.1016/j.tcs.2025.115644_bib0003 – volume: 1024 year: 2025 ident: 10.1016/j.tcs.2025.115644_bib0001 article-title: The exact subset multicover problem publication-title: Theor. Comput. Sci doi: 10.1016/j.tcs.2024.114936 – volume: 25 start-page: 499 year: 1978 ident: 10.1016/j.tcs.2025.115644_bib0002 article-title: ’Strong’ NP-Completeness Results: Motivation, Examples, and Implications publication-title: J. ACM doi: 10.1145/322077.322090 |
| SSID | ssj0000576 |
| Score | 2.4563563 |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 115644 |
| Title | On the complexity of a problem related to Set Cover |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NS8MwGA66edCDH1Pxmxw8OTqatmna45CJCm6CO-xWkiZFh3Rjq2U_37dt-uFQ0IOX0IYQQp7wvE-b9wOhaw6cz9yIGZl-NRymhCEE9Q3CIzfiYBGJKopNsOHQm0z8Z10xdJmXE2Bx7K1W_vxfoYY-ADsLnf0D3NWk0AHPADq0ADu0vwJ-VDgu5r7iaqU9LnhXV44pgldAZYLmfFEJ8EGq_XOn1bmpIhtDXfKhq-1k9TvmFXggzdmbg5V952nz54FFdRRdzTF2djHiM9rgMJLlj3G-pdfiS3_aS8Is07lFe_XYr6ms10xM5fhX-pRNA5giyKYIiik2Udti1AdeavcfBpPH2ppSVtw364WWN9O5j97aOhraoiESxvtoV6t73C9QOUAbKu6gvbJyBtZE2kE7T1W23OUhskcxhldcQ4ZnEeZYQ4Y1ZDiZYYAM55AdofHdYHx7b-hiFkboO47BXSFBKtmSMDNUIrIzJUyJZMIWrq0iIakIqYpkJGUoiEOFS4i0BOWew01l2seoFc9idYIwI5IrW8EwU4KYJZ5yhVAgZaHhINhO0U25C8G8SFkS_LjvZ38ZfI6260N0gVrJ4kNdoq0wTd6WiyuN3CdY3jib |
| 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=On+the+complexity+of+a+problem+related+to+Set+Cover&rft.jtitle=Theoretical+computer+science&rft.au=Shitov%2C+Yaroslav&rft.date=2025-11-01&rft.issn=0304-3975&rft.spage=115644&rft_id=info:doi/10.1016%2Fj.tcs.2025.115644&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2025_115644 |
| 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 |