{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/metaheuristics-for-the-minimum-set-cover","title":"Metaheuristics for the Minimum Set Cover Problem: A Comparison","arxiv_id":null,"date":"2020-11-12","proceeding":"ECTA 2020 11","authors":["Lukas Rosenbauer","Helena Stegherr","Anthony Stein","Jörg Hähner"],"abstract":"The minimum set cover problem (MSCP) is one of the first NP-hard optimization problems discovered. Theoretically it has a bad worst case approximation ratio. As the MSCP turns out to appear in several real world\r\nproblems, various approaches exist where evolutionary algorithms and metaheuristics are utilized in order to\r\nachieve good average case results. This work is intended to revisit and compare current results regarding the\r\napplication of metaheuristics for the MSCP. Therefore, a recapitulation of the MSCP and its classification into\r\nthe class of NP-hard optimization problems are provided first. After an overview of notable approximation\r\nmethods, the focus is shifted towards a brief review of existing metaheuristics which were adapted for the\r\nMSCP. In order to allow for a targeted comparison of the existing algorithms, the theoretical worst case complexities in terms of the big O-notation are derived first. This is followed by an empirical study where the\r\nidentified metaheuristics are examined. Here we use Steiner triple systems, Beasley’s OR library, and introduce a new class of instances. Several of the considered approaches achieve close to optimal results. However,\r\nour analysis reveals significant differences in terms of runtime and shows that some approaches may even have\r\nexponential runtime.","url_abs":"https://www.researchgate.net/publication/346826681_Metaheuristics_for_the_Minimum_Set_Cover_Problem_A_Comparison","url_pdf":"https://www.researchgate.net/publication/346826681_Metaheuristics_for_the_Minimum_Set_Cover_Problem_A_Comparison","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"metaheuristics-for-the-minimum-set-cover","repo_url":"https://github.com/LagLukas/mscp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"LagLukas/mscp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"203171bc83b5a7ff97e5ae891c2f479c8261be3e5d4fef29cbd271fdb974d9dc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}