{"id":"https://openalex.org/W1493650034","doi":"https://doi.org/10.1145/1276958.1277118","title":"Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models","display_name":"Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models","publication_year":2007,"publication_date":"2007-07-07","ids":{"openalex":"https://openalex.org/W1493650034","doi":"https://doi.org/10.1145/1276958.1277118","mag":"1493650034","pmid":"https://pubmed.ncbi.nlm.nih.gov/20583912"},"language":"en","primary_location":{"id":"doi:10.1145/1276958.1277118","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1276958.1277118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://eldorado.tu-dortmund.de/bitstreams/0c73f69d-0bdb-4ff4-a057-d07d4c5d68c8/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, tobias.friedrich@mpi-inf.mpg.de#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, tobias.friedrich@mpi-inf.mpg.de#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100639998","display_name":"Jun He","orcid":"https://orcid.org/0000-0002-5616-4691"},"institutions":[{"id":"https://openalex.org/I16038530","display_name":"Aberystwyth University","ror":"https://ror.org/015m2p889","country_code":"GB","type":"education","lineage":["https://openalex.org/I16038530"]},{"id":"https://openalex.org/I97429440","display_name":"University of Wales","ror":"https://ror.org/01se4f844","country_code":"GB","type":"education","lineage":["https://openalex.org/I97429440"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jun He","raw_affiliation_strings":["Department of Computer Science, University of Wales, Aberystwyth, United Kingdom","Department of Computer Science, University of Wales, Aberystwyth, United Kingdom [email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wales, Aberystwyth, United Kingdom","institution_ids":["https://openalex.org/I16038530","https://openalex.org/I97429440"]},{"raw_affiliation_string":"Department of Computer Science, University of Wales, Aberystwyth, United Kingdom [email\u00a0protected]#TAB#","institution_ids":["https://openalex.org/I16038530","https://openalex.org/I97429440"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063331845","display_name":"Nils Hebbinghaus","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nils Hebbinghaus","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, nils.hebbinghaus@mpi-inf.mpg.de"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, nils.hebbinghaus@mpi-inf.mpg.de","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany frank.neumann@mpi-inf.mpg.de#TAB#"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany frank.neumann@mpi-inf.mpg.de#TAB#","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark","DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark [email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark [email\u00a0protected]#TAB#","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5077389210"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.06032296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"4","first_page":"617","last_page":"633"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/heuristics","display_name":"Heuristics","score":0.8341593742370605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6264036297798157},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5958389043807983},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5358331203460693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5084132552146912},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48192667961120605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.431529700756073},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42861872911453247},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42812132835388184},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41200166940689087},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12814822793006897}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8341593742370605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6264036297798157},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5958389043807983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5358331203460693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5084132552146912},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48192667961120605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.431529700756073},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42861872911453247},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42812132835388184},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41200166940689087},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12814822793006897},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011336","descriptor_name":"Probability","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011336","descriptor_name":"Probability","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011336","descriptor_name":"Probability","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D057386","descriptor_name":"Search Engine","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":17,"locations":[{"id":"doi:10.1145/1276958.1277118","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1276958.1277118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"doi:10.1162/evco_a_00003","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00003","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:20583912","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/20583912","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/26131","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/26131","pdf_url":"http://eldorado.tu-dortmund.de/bitstreams/0c73f69d-0bdb-4ff4-a057-d07d4c5d68c8/download","source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.151.9295","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.9295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~tfried/paper/ECJ2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.5862","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.5862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2007/027/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.7844","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.7844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ls2-www.cs.uni-dortmund.de/~witt/ci-22407.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.4360","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/67360","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/67360","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1276958.1277118","raw_type":"Conference paper"},{"id":"pmh:oai:edoc.mpg.de:356751","is_oa":false,"landing_page_url":"http://edoc.mpg.de/356751","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thierens, Dirk: GECCO 2007 : Genetic and Evolutionary Computation Conference. - Vol. 1, ACM, 797-804 (2007)","raw_type":"Conference-Paper"},{"id":"pmh:oai:edoc.mpg.de:536721","is_oa":false,"landing_page_url":"http://edoc.mpg.de/536721","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Evolutionary Computation, v.18, 617-633 (2010)","raw_type":"Article"},{"id":"pmh:oai:irep.ntu.ac.uk:38987","is_oa":false,"landing_page_url":"http://irep.ntu.ac.uk/id/eprint/38987/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400559","display_name":"Nottingham Trent University's Institutional Repository (Nottingham Trent Repository)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I52590639","host_organization_name":"Nottingham Trent University","host_organization_lineage":["https://openalex.org/I52590639"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:publications/52f4a995-afdd-41c4-86e6-b3bb226fddac","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/52f4a995-afdd-41c4-86e6-b3bb226fddac","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Friedrich , T , He , J , Hebbinghaus , N , Neumann , F & Witt , C 2010 , ' Approximating covering problems by randomized search heuristics using multi-objective models ' , Evolutionary Computation , vol. 18 , no. 4 , pp. 617-633 . https://doi.org/10.1162/EVCO_a_00003","raw_type":"article"},{"id":"pmh:oai:pure.mpg.de:item_1323815","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1601-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Evolutionary Computation","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1327706","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1E23-F","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO 2007 : Genetic and Evolutionary Computation Conference. - Vol. 1","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.17877/de290r-8706","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-8706","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"},{"id":"mag:1493650034","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc14.html#FriedrichHHNW07","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/26131","is_oa":true,"landing_page_url":"http://hdl.handle.net/2003/26131","pdf_url":"http://eldorado.tu-dortmund.de/bitstreams/0c73f69d-0bdb-4ff4-a057-d07d4c5d68c8/download","source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3171094092","display_name":null,"funder_award_id":"SFB 531","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5106512922","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6024419964","display_name":null,"funder_award_id":"Deutsche Forschungsgemeinschaft (DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1493650034.pdf","grobid_xml":"https://content.openalex.org/works/W1493650034.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1552383524","https://openalex.org/W1636202028","https://openalex.org/W2003159902","https://openalex.org/W2034762222","https://openalex.org/W2066124178","https://openalex.org/W2091824805","https://openalex.org/W2097724176","https://openalex.org/W2105792062","https://openalex.org/W2143996311","https://openalex.org/W2152688255","https://openalex.org/W2157054705","https://openalex.org/W2165220807","https://openalex.org/W2295428206","https://openalex.org/W2309459014","https://openalex.org/W2585305412","https://openalex.org/W2798588639","https://openalex.org/W3145128584","https://openalex.org/W6750258011","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3086732470","https://openalex.org/W2559279975","https://openalex.org/W2021646037","https://openalex.org/W22774824","https://openalex.org/W1541199196","https://openalex.org/W3118872643","https://openalex.org/W2041107958","https://openalex.org/W2109007905","https://openalex.org/W2964299247","https://openalex.org/W2962785075","https://openalex.org/W1525993618","https://openalex.org/W2136258730","https://openalex.org/W3165616834","https://openalex.org/W124548777","https://openalex.org/W2002213448","https://openalex.org/W1571154537","https://openalex.org/W3128600893","https://openalex.org/W3035808072","https://openalex.org/W3044994834","https://openalex.org/W3013029182"],"abstract_inverted_index":{"The":[0],"main":[1],"aim":[2],"of":[3,12,19,42,49,78,115,118],"randomized":[4,43],"search":[5,44],"heuristics":[6,45],"is":[7],"to":[8,23,74],"produce":[9],"good":[10,87],"approximations":[11],"optimal":[13,79,106],"solutions":[14,80,107],"within":[15,92,111],"a":[16,30,75,112],"small":[17],"amount":[18],"time.":[20,96],"In":[21],"contrast":[22],"numerous":[24],"experimental":[25],"results,":[26],"there":[27],"are":[28],"only":[29],"few":[31],"theoretical":[32],"explorations":[33],"on":[34],"this":[35],"subject.":[36],"We":[37],"consider":[38],"the":[39,47,62,70,83,93,98,116,119,123,127,132],"approximation":[40,88,128],"ability":[41],"for":[46,58],"class":[48],"covering":[50],"problems":[51],"and":[52,55],"compare":[53],"single-objective":[54,84,133],"multi-objective":[56,71,124],"models":[57],"such":[59],"problems.":[60],"For":[61],"VertexCover":[63],"problem,":[64,102],"we":[65,103],"point":[66],"out":[67],"situations":[68],"where":[69],"model":[72],"leads":[73],"fast":[76],"construction":[77],"while":[81,126],"in":[82,135],"case,":[85],"no":[86],"can":[89,108],"be":[90,109,140],"achieved":[91],"expected":[94,136],"polynomial":[95,137],"Examining":[97],"more":[99],"general":[100],"SetCover":[101],"show":[104],"that":[105],"approximated":[110],"logarithmic":[113],"factor":[114],"size":[117],"ground":[120],"set,":[121],"using":[122],"approach,":[125],"quality":[129],"obtainable":[130],"by":[131],"approach":[134],"time":[138],"may":[139],"arbitrarily":[141],"bad.":[142]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}