Average-case complexity of a branch-and-bound algorithm for Min Dominating Set

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 345; s. 4 - 8
Hlavní autori: Denat, Tom, Harutyunyan, Ararat, Melissinos, Nikolaos, Paschos, Vangelis Th
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier 15.03.2024
Predmet:
Computer Science
Discrete Mathematics
ISSN:0166-218X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Author Paschos, Vangelis Th
Harutyunyan, Ararat
Melissinos, Nikolaos
Denat, Tom
Author_xml – sequence: 1
  givenname: Tom
  surname: Denat
  fullname: Denat, Tom
– sequence: 2
  givenname: Ararat
  surname: Harutyunyan
  fullname: Harutyunyan, Ararat
– sequence: 3
  givenname: Nikolaos
  surname: Melissinos
  fullname: Melissinos, Nikolaos
– sequence: 4
  givenname: Vangelis Th
  surname: Paschos
  fullname: Paschos, Vangelis Th
BackLink https://hal.science/hal-04713668$$DView record in HAL
BookMark eNp9kLtOwzAUhj0UibbwAGxeGRJ8ycUZq3IpUoEBkNisY8duXSV25YSKvj2JihgYmI7Or_870vlmaOKDNwhdUZJSQoubXVpDmzLCeEppShidoOmQFwmj4uMczbpuRwihwzZFz4uDibAxiYbOYB3afWO-XH_EwWLAKoLX2wR8najw6WsMzSZE129bbEPET87j29A6D73zG_xq-gt0ZqHpzOXPnKP3-7u35SpZvzw8LhfrRHPG-iQHRqzIRF0pASC0qEFzwzOtciIMlJmqCp0xU3KhFMmrwnJWVNYqQzMwecnn6Pp0dwuN3EfXQjzKAE6uFms5ZiQrKS8KcaBDl566Ooaui8b-ApTIUZjcyUGYHIVJSuUgbGDKP4x2_fBl8H0E1_xDfgOB1HVX
CitedBy_id crossref_primary_10_1016_j_comnet_2025_111477
crossref_primary_10_1016_j_petsci_2024_12_011
crossref_primary_10_1109_JIOT_2025_3538796
crossref_primary_10_1016_j_segan_2024_101279
crossref_primary_10_1016_j_jclepro_2025_145866
Cites_doi 10.1007/s10479-006-0091-y
10.1016/j.ic.2017.06.001
10.1287/moor.2017.0866
10.1007/978-3-319-59250-3_13
10.1137/130916357
10.1007/s10107-022-01828-1
10.1016/j.dam.2011.07.001
10.1007/s10107-022-01895-4
ContentType Journal Article
Copyright Public Domain
Copyright_xml – notice: Public Domain
DBID AAYXX
CITATION
1XC
DOI 10.1016/j.dam.2023.11.021
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EndPage 8
ExternalDocumentID oai:HAL:hal-04713668v1
10_1016_j_dam_2023_11_021
GroupedDBID -~X
AAYXX
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
CITATION
FA8
FDB
OAUVE
VH1
WUQ
1XC
ID FETCH-LOGICAL-c322t-5a20f848d9b8aa8c8dac3e34cb508ea74b96c42e738bb0596f3269ffbe14ae573
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001119037800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Tue Oct 14 20:36:42 EDT 2025
Tue Nov 18 21:50:12 EST 2025
Sat Nov 29 07:26:37 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License Public Domain: http://hal.archives-ouvertes.fr/licences/publicDomain
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c322t-5a20f848d9b8aa8c8dac3e34cb508ea74b96c42e738bb0596f3269ffbe14ae573
OpenAccessLink https://hal.science/hal-04713668
PageCount 5
ParticipantIDs hal_primary_oai_HAL_hal_04713668v1
crossref_primary_10_1016_j_dam_2023_11_021
crossref_citationtrail_10_1016_j_dam_2023_11_021
PublicationCentury 2000
PublicationDate 2024-03-15
PublicationDateYYYYMMDD 2024-03-15
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-03-15
  day: 15
PublicationDecade 2020
PublicationTitle Discrete Applied Mathematics
PublicationYear 2024
Publisher Elsevier
Publisher_xml – name: Elsevier
References Flajolet (10.1016/j.dam.2023.11.021_b11) 2008
Borst (10.1016/j.dam.2023.11.021_b5) 2023; 197
Dey (10.1016/j.dam.2023.11.021_b9) 2023; 200
10.1016/j.dam.2023.11.021_b8
Dey (10.1016/j.dam.2023.11.021_b10) 2018; 43
Xiao (10.1016/j.dam.2023.11.021_b14) 2017; 255
Banderier (10.1016/j.dam.2023.11.021_b2) 2014; 28
Bollobás (10.1016/j.dam.2023.11.021_b4) 1985
Bixby (10.1016/j.dam.2023.11.021_b3) 2007; 149
van Rooij (10.1016/j.dam.2023.11.021_b13) 2011; 159
Knuth (10.1016/j.dam.2023.11.021_b12) 1969
Borst (10.1016/j.dam.2023.11.021_b6) 2023
10.1016/j.dam.2023.11.021_b1
Bourgeois (10.1016/j.dam.2023.11.021_b7) 2015
References_xml – year: 1969
  ident: 10.1016/j.dam.2023.11.021_b12
– volume: 149
  start-page: 37
  year: 2007
  ident: 10.1016/j.dam.2023.11.021_b3
  article-title: Progress in computational mixed integer programming - A look back from the other side of the tipping point
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-006-0091-y
– volume: 255
  start-page: 126
  year: 2017
  ident: 10.1016/j.dam.2023.11.021_b14
  article-title: Exact algorithms for maximum independent set
  publication-title: Inform. and Comput.
  doi: 10.1016/j.ic.2017.06.001
– year: 2008
  ident: 10.1016/j.dam.2023.11.021_b11
– volume: 43
  start-page: 304
  year: 2018
  ident: 10.1016/j.dam.2023.11.021_b10
  article-title: Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2017.0866
– ident: 10.1016/j.dam.2023.11.021_b8
  doi: 10.1007/978-3-319-59250-3_13
– year: 1985
  ident: 10.1016/j.dam.2023.11.021_b4
– volume: 28
  start-page: 342
  issue: 1
  year: 2014
  ident: 10.1016/j.dam.2023.11.021_b2
  article-title: Analysis of an exhaustive search algorithm in random graphs and the nclogn-asymptotics
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/130916357
– volume: 197
  start-page: 1221
  year: 2023
  ident: 10.1016/j.dam.2023.11.021_b5
  article-title: On the integrality gap of binary integer programs with Gaussian data
  publication-title: Math. Program.
  doi: 10.1007/s10107-022-01828-1
– year: 2015
  ident: 10.1016/j.dam.2023.11.021_b7
– volume: 159
  start-page: 2147
  issue: 17
  year: 2011
  ident: 10.1016/j.dam.2023.11.021_b13
  article-title: Exact algorithms for dominating set
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2011.07.001
– start-page: 1692
  year: 2023
  ident: 10.1016/j.dam.2023.11.021_b6
  article-title: Integrality gaps for random integer programs via discrepancy
– ident: 10.1016/j.dam.2023.11.021_b1
– volume: 200
  start-page: 569
  year: 2023
  ident: 10.1016/j.dam.2023.11.021_b9
  article-title: Branch-and-bound solves random binary IPs in poly(n)-time
  publication-title: Math. Program.
  doi: 10.1007/s10107-022-01895-4
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.4148338
SourceID hal
crossref
SourceType Open Access Repository
Enrichment Source
Index Database
StartPage 4
SubjectTerms Computer Science
Discrete Mathematics
Title Average-case complexity of a branch-and-bound algorithm for Min Dominating Set
URI https://hal.science/hal-04713668
Volume 345
WOSCitedRecordID wos001119037800001&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: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20211211
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0001218
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 20220331
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0001218
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKx8P2wGWANm6yEE9URk3sJM5jxDZ1sFWVVqS-RbbrkIyQTqWtuh_Df-U4zq0TQuOBl6hynTTx-XpuOf4OQu-pgOgm9AISgLkjTCbwl_K0IO7cm2tHcdCZttlEMB7z2Syc9Hq_6r0wmzwoCr7dhjf_VdQwBsI2W2f_QdzNRWEAPoPQ4Qhih-O9BB_BHYOSIEqUleiG_Xdb1V2IgTR9NFIiijmRpqHSQOTfFstslf4o6w0vswJcalMdU1ZDX-mdzP1JBjoGnOzGdb1sOF_b9vQazi1BYB_NarflenW7Lm5tsjVaGrrxRtI6B9lnVbnfOPsOsfaiudxEmOjbdmw32yBg7mCadlMVLjO1Wnazps2fVca-m870fQJOxqyrjynzOhqVdU3zH3W-TT9cw88aZgGXfjSsrHbb9S6_9ii6iicnZ_HF-fjL7redosRRdAHHVORkCHab-j7fQHC95wZeyPtoLzo_nX3u8JMZ8r39OqPXvsACR45VtPL2AesX6mVp4Z073XGJHqR1Rr_0cKZP0KMqNMGRhdRT1NPFIXpct_3AlRU4RAcdsT9D4y7ecIs3vEiwwHfxhhu8YcAbBrzhFm8Y8PYcfT07nX4akapJB1FgC1bEE-4w4YzPQ8mF4IrPhaKaMiXB9dciYDL0FXN1QLmUptdTAgFDmCRSO0xoL6AvUL9YFPoIYbMHmnNwGJ1EMEeGPJRDnThKUKpU4ofHaFivU6wqBnvTSCWP61LF6xiWNjZLC5FtDEt7jD40p9xY-pa_TX4Hi9_MM8TrgIbYjLVYeHmfSa_Qfov_16i_Wq71G_RQbVbZz-XbCkW_AbxBmw4
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=Average-case+complexity+of+a+branch-and-bound+algorithm+for+Min+Dominating+Set&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Denat%2C+Tom&rft.au=Harutyunyan%2C+Ararat&rft.au=Melissinos%2C+Nikolaos&rft.au=Paschos%2C+Vangelis+Th&rft.date=2024-03-15&rft.pub=Elsevier&rft.issn=0166-218X&rft.volume=345&rft.spage=4&rft.epage=8&rft_id=info:doi/10.1016%2Fj.dam.2023.11.021&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-04713668v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon