{"id":"https://openalex.org/W7225655355","doi":"https://doi.org/10.21203/rs.3.rs-11638585/v1","title":"A Reproducible Benchmark Dataset and Experimental Evaluation for the Minimum s-Club Cover Problem","display_name":"A Reproducible Benchmark Dataset and Experimental Evaluation for the Minimum s-Club Cover Problem","publication_year":2026,"publication_date":"2026-11-09","ids":{"openalex":"https://openalex.org/W7225655355","doi":"https://doi.org/10.21203/rs.3.rs-11638585/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11638585/v1","doi":"https://doi.org/10.21203/rs.3.rs-11638585/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11638585/v1","pdf_url":"https://www.researchsquare.com/article/rs-11638585/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11638585/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5160529016","display_name":"Dat Manh M\u1ea1nh \u0110\u1ea1t","orcid":"https://orcid.org/0009-0001-4320-1529","observed_orcids":["https://orcid.org/0009-0001-4320-1529"]},"institutions":[{"id":"https://openalex.org/I4210139842","display_name":"Tay Bac University","ror":"https://ror.org/04j5g5g52","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210139842"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"M\u1ea1nh \u0110\u1ea1t","raw_affiliation_strings":["Tay Bac University"],"raw_orcid":"https://orcid.org/0009-0001-4320-1529","affiliations":[{"raw_affiliation_string":"Tay Bac University","institution_ids":["https://openalex.org/I4210139842"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5160529016"],"corresponding_institution_ids":["https://openalex.org/I4210139842"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7720000147819519,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7720000147819519,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.08760000020265579,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.04830000177025795,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark-dataset","display_name":"benchmark dataset","score":0.5830000042915344},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6539999842643738},{"id":"https://openalex.org/keywords/community-detection","display_name":"community detection","score":0.6349999904632568},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7670000195503235},{"id":"https://openalex.org/keywords/dimacs-benchmark-graphs","display_name":"DIMACS benchmark graphs","score":0.718999981880188},{"id":"https://openalex.org/keywords/evolutionary-algorithms","display_name":"evolutionary algorithms","score":0.5170000195503235},{"id":"https://openalex.org/keywords/learning-augmented-algorithms","display_name":"learning-augmented algorithms","score":0.8820000290870667},{"id":"https://openalex.org/keywords/reproducibility","display_name":"reproducibility","score":0.6840000152587891},{"id":"https://openalex.org/keywords/social-networks","display_name":"social networks","score":0.4790000021457672},{"id":"https://openalex.org/keywords/biological-networks","display_name":"biological networks","score":0.5799999833106995}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8048999905586243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6603999733924866},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.45559999346733093},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4449000060558319},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4049000144004822},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.38350000977516174},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.376800000667572},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3702999949455261},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.33660000562667847},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.3301999866962433},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C206041023","wikidata":"https://www.wikidata.org/wiki/Q1751970","display_name":"Wilcoxon signed-rank test","level":3,"score":0.3003999888896942},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.28299999237060547},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2793999910354614},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11638585/v1","doi":"https://doi.org/10.21203/rs.3.rs-11638585/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11638585/v1","pdf_url":"https://www.researchsquare.com/article/rs-11638585/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11638585/v1","doi":"https://doi.org/10.21203/rs.3.rs-11638585/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11638585/v1","pdf_url":"https://www.researchsquare.com/article/rs-11638585/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225655355.pdf","grobid_xml":"https://content.openalex.org/works/W7225655355.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1978813754","https://openalex.org/W2008985174","https://openalex.org/W2168405694","https://openalex.org/W2302501749","https://openalex.org/W2406493898","https://openalex.org/W2560471521","https://openalex.org/W2736601468","https://openalex.org/W2937274722","https://openalex.org/W4252684946","https://openalex.org/W4390943132"],"related_works":["https://openalex.org/W7225458427","https://openalex.org/W7225140525","https://openalex.org/W4409852411","https://openalex.org/W2285114768","https://openalex.org/W4390943132","https://openalex.org/W4402211970","https://openalex.org/W2763469127","https://openalex.org/W4417452343","https://openalex.org/W4408421782","https://openalex.org/W2937274722"],"abstract_inverted_index":{"Abstract":[0],"The":[1,86],"Minimum":[2],"s-Club":[3],"Cover":[4],"(MSCC)":[5],"problem":[6],"is":[7],"an":[8],"NP-hard":[9],"and":[10,28,34,57,67,77,107,110,137,147,160,183,201],"APX-hard":[11],"combinatorial":[12],"optimization":[13,128],"challenge":[14],"on":[15,39],"graphs":[16,115],"with":[17,116,188],"significant":[18],"applications":[19],"in":[20],"social":[21],"network":[22],"community":[23],"detection,":[24],"computational":[25,37],"molecular":[26],"biology,":[27],"telecommunication":[29],"routing.":[30],"Despite":[31],"its":[32],"theoretical":[33],"operational":[35],"relevance,":[36],"research":[38],"MSCC":[40,84],"currently":[41],"suffers":[42],"from":[43,104],"a":[44,74,166],"lack":[45],"of":[46,52],"standardized":[47,90],"open":[48,69],"benchmark":[49,81,91,114],"instances,":[50,123,196],"absence":[51],"granular":[53,173],"per-run":[54],"execution":[55],"logs,":[56,175],"inconsistent":[58],"feasibility":[59,169],"reporting.":[60],"To":[61],"bridge":[62],"these":[63,121],"critical":[64],"methodological":[65],"gaps":[66],"promote":[68],"science,":[70],"this":[71],"paper":[72],"presents":[73],"comprehensive,":[75],"standardized,":[76],"fully":[78],"reproducible":[79],"empirical":[80],"suite":[82],"for":[83],"($s=2$).":[85],"dataset":[87],"encompasses":[88],"30":[89,122],"graph":[92,195],"instances":[93],"partitioned":[94],"into":[95],"two":[96],"distinct":[97],"structural":[98],"families:":[99],"12":[100],"real-world":[101],"complex":[102],"networks":[103],"biological,":[105],"social,":[106],"information":[108],"domains,":[109],"18":[111],"symmetric":[112],"DIMACS":[113],"varying":[117],"topological":[118],"densities.":[119],"Across":[120],"we":[124],"provide":[125],"4,800":[126],"complete":[127],"runs":[129],"conducted":[130],"over":[131],"20":[132],"synchronized":[133],"paired":[134],"random":[135,180],"seeds":[136],"eight":[138],"comparative":[139],"algorithms":[140],"spanning":[141],"constructive":[142],"heuristics,":[143],"static/random":[144],"evolutionary":[145],"algorithms,":[146],"adaptive":[148],"learning-augmented":[149],"baselines.":[150],"All":[151,194],"discovered":[152],"solutions":[153],"are":[154,204],"strictly":[155],"verified":[156,167],"through":[157],"breadth-first":[158],"search":[159],"all-pairs":[161],"shortest":[162],"path":[163],"calculations,":[164],"achieving":[165],"100%":[168],"rate.":[170],"We":[171],"report":[172],"raw":[174],"aggregated":[176],"summary":[177],"metrics,":[178],"optimal":[179],"seed":[181],"distributions,":[182],"non-parametric":[184],"Wilcoxon":[185],"signed-rank":[186],"tests":[187],"Holm-Bonferroni":[189],"correction":[190],"($1-\\beta":[191],">":[192],"0.85$).":[193],"raw/aggregated":[197],"data,":[198],"configuration":[199],"files,":[200],"verification":[202],"scripts":[203],"released":[205],"openly":[206],"under":[207],"the":[208],"permissive":[209],"Creative":[210],"Commons":[211],"Attribution":[212],"4.0":[213],"International":[214],"license.":[215]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-11-10T00:00:00"}