The Exact Subset MultiCover problem

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 1024; s. 114936
Hlavní autoři: Benoist, Emile, Fertin, Guillaume, Jean, Géraldine
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier 12.01.2025
Témata:
Bioinformatics
Computational Complexity
Computer Science
Data Structures and Algorithms
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
ArticleNumber 114936
Author Benoist, Emile
Fertin, Guillaume
Jean, Géraldine
Author_xml – sequence: 1
  givenname: Emile
  orcidid: 0009-0005-1990-9796
  surname: Benoist
  fullname: Benoist, Emile
– sequence: 2
  givenname: Guillaume
  surname: Fertin
  fullname: Fertin, Guillaume
– sequence: 3
  givenname: Géraldine
  surname: Jean
  fullname: Jean, Géraldine
BackLink https://hal.science/hal-04914852$$DView record in HAL
BookMark eNo9kMFLwzAYxYNMsJv-Ad4Knjy0fl-SJs1xlLkJFQ_Oc0jTlLV062i6of-9LRXf5cHjvXf4Lcni1J0cIY8IMQKKlyYerI8pUB4jcsXEDQkwlSqiVPEFCYABj5iSyR1Zet_AqESKgDztDy7cfBs7hJ-XwrshfL-0Q511V9eH574rWne8J7eVab17-PMV-Xrd7LNdlH9s37J1HlnKcIiMRVlSzmlJU6cY5wBFJV0pmYHKArWlShSABcEg4ZhSUUrlpBBl4WjFCrYiz_PvwbT63NdH0__oztR6t871lAFXyNOEXnHs4ty1fed976r_AYKeiOhGj0T0RETPRNgvwytUEA
Cites_doi 10.1007/BF02579200
10.1137/S0097539703422479
10.1006/jcss.2001.1774
10.1016/0166-218X(84)90081-7
10.1006/jcss.2000.1727
10.1287/moor.8.4.538
ContentType Journal Article
Copyright Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
DOI 10.1016/j.tcs.2024.114936
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
ExternalDocumentID oai:HAL:hal-04914852v1
10_1016_j_tcs_2024_114936
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
1XC
XJT
ID FETCH-LOGICAL-c231t-ac17d2442d28e934400bf7ed73a0fc02cd95900c0630541826d79e766dbe2f3b3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001350649000001&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 Tue Oct 14 20:35:17 EDT 2025
Sat Nov 29 05:49:22 EST 2025
IsPeerReviewed true
IsScholarly true
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c231t-ac17d2442d28e934400bf7ed73a0fc02cd95900c0630541826d79e766dbe2f3b3
ORCID 0009-0005-1990-9796
0000-0002-8251-2012
ParticipantIDs hal_primary_oai_HAL_hal_04914852v1
crossref_primary_10_1016_j_tcs_2024_114936
PublicationCentury 2000
PublicationDate 2025-01-12
PublicationDateYYYYMMDD 2025-01-12
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-12
  day: 12
PublicationDecade 2020
PublicationTitle Theoretical computer science
PublicationYear 2025
Publisher Elsevier
Publisher_xml – name: Elsevier
References Chuzhoy (10.1016/j.tcs.2024.114936_br0040) 2006; 36
He (10.1016/j.tcs.2024.114936_br0050) 2016
Gärtner (10.1016/j.tcs.2024.114936_br0110) 2007
Impagliazzo (10.1016/j.tcs.2024.114936_br0090) 2001; 63
Benoist (10.1016/j.tcs.2024.114936_br0010) 2022; vol. 13571
Impagliazzo (10.1016/j.tcs.2024.114936_br0080) 2001; 62
Lenstra (10.1016/j.tcs.2024.114936_br0140) 1983; 8
Tovey (10.1016/j.tcs.2024.114936_br0070) 1984; 8
Ingvar (10.1016/j.tcs.2024.114936_br0060) 2008
Gusfield (10.1016/j.tcs.2024.114936_br0120) 2019
Karp (10.1016/j.tcs.2024.114936_br0020) 1972
Hua (10.1016/j.tcs.2024.114936_br0030) 2009
Frank (10.1016/j.tcs.2024.114936_br0130) 1987; 7
Garey (10.1016/j.tcs.2024.114936_br0100) 1979
References_xml – volume: 7
  start-page: 49
  issue: 1
  year: 1987
  ident: 10.1016/j.tcs.2024.114936_br0130
  article-title: An application of simultaneous Diophantine approximation in combinatorial optimization
  publication-title: Combinatorica
  doi: 10.1007/BF02579200
– year: 2007
  ident: 10.1016/j.tcs.2024.114936_br0110
  article-title: Understanding and Using Linear Programming
– start-page: 34
  year: 2009
  ident: 10.1016/j.tcs.2024.114936_br0030
  article-title: Exact algorithms for set multicover and multiset multicover problems
– volume: vol. 13571
  start-page: 189
  year: 2022
  ident: 10.1016/j.tcs.2024.114936_br0010
  article-title: The exact subset multicover problem
– volume: 36
  start-page: 498
  issue: 2
  year: 2006
  ident: 10.1016/j.tcs.2024.114936_br0040
  article-title: Covering problems with hard capacities
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539703422479
– year: 2008
  ident: 10.1016/j.tcs.2024.114936_br0060
– start-page: 237
  year: 2016
  ident: 10.1016/j.tcs.2024.114936_br0050
– volume: 63
  start-page: 512
  issue: 4
  year: 2001
  ident: 10.1016/j.tcs.2024.114936_br0090
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.2001.1774
– volume: 8
  start-page: 85
  issue: 1
  year: 1984
  ident: 10.1016/j.tcs.2024.114936_br0070
  article-title: A simplified NP-complete satisfiability problem
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(84)90081-7
– start-page: 85
  year: 1972
  ident: 10.1016/j.tcs.2024.114936_br0020
  article-title: Reducibility among combinatorial problems
– volume: 62
  start-page: 367
  issue: 2
  year: 2001
  ident: 10.1016/j.tcs.2024.114936_br0080
  article-title: On the complexity of k-sat
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.2000.1727
– year: 2019
  ident: 10.1016/j.tcs.2024.114936_br0120
– year: 1979
  ident: 10.1016/j.tcs.2024.114936_br0100
– volume: 8
  start-page: 538
  issue: 4
  year: 1983
  ident: 10.1016/j.tcs.2024.114936_br0140
  article-title: Integer programming with a fixed number of variables
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.4.538
SSID ssj0000576
Score 2.43257
SourceID hal
crossref
SourceType Open Access Repository
Index Database
StartPage 114936
SubjectTerms Bioinformatics
Computational Complexity
Computer Science
Data Structures and Algorithms
Title The Exact Subset MultiCover problem
URI https://hal.science/hal-04914852
Volume 1024
WOSCitedRecordID wos001350649000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 20211213
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8QwFA5uBz24iztFPTlUMkk6aY6DjBsqHkaYW2nTFEe0itOR-fm-16SdURH04KWUtDzafuXl7R8hRy3KNWZz_CxsKV-ImPuKx4FPTZgJ7BpgRpdkE_L2Nuz11J3jcB-UdAIyz8PRSL3-K9SwBmBj6-wf4K6FwgKcA-hwBNjh-GvgOyNsfUSlYIpG2WN7iqWaDUcfM2mRdic6GbWjeGi4fbH21U3-0rfNIZ3n_lO9fmaqGQTnQ2QvGj7Xl66Mjaye20w8Br6qDL6LMTAs5_Obk2FHjvkTZTlOar1JmZhQfeBYKTvL5JtWtgGCx5NC44B0Jk7G936egP1lZ6rrBatStMcIREQoIrIipsksk4ECjTzbvuz0rsabcCBtmto9eJXQLkv7vjzHJ5Nk-qGKqJcWRneZLDrXwGtbSFfIlMlXyVJFu-E5LbxKFm7qUbuDNXIIAHol3p7F2xvj7Tm818n9Wad7euE75gtfg71d-LFuyhQML5ay0CguQNEmmTSp5DHNNGU6Vcj2qnFgWiDQRUylMrLVShPDMp7wDTKTv-Rmk3hZDDYmVdQkLBFxRuPAUGpkwuJAq0TwLXJcvXz0agecRD9-7i1yAJ-nvg9Hk1-0ryNcA08TPOuAvTe3_yJxh8yPf7hdMlO8Dc0emdPvRX_wtu9Q_QBxTE_l
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=The+Exact+Subset+MultiCover+problem&rft.jtitle=Theoretical+computer+science&rft.au=Benoist%2C+Emile&rft.au=Fertin%2C+Guillaume&rft.au=Jean%2C+G%C3%A9raldine&rft.date=2025-01-12&rft.issn=0304-3975&rft.volume=1024&rft.spage=114936&rft_id=info:doi/10.1016%2Fj.tcs.2024.114936&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2024_114936
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