{"id":"https://openalex.org/W3143957333","doi":"https://doi.org/10.1145/3567674","title":"Minimum Scan Cover and Variants: Theory and Experiments","display_name":"Minimum Scan Cover and Variants: Theory and Experiments","publication_year":2022,"publication_date":"2022-10-12","ids":{"openalex":"https://openalex.org/W3143957333","doi":"https://doi.org/10.1145/3567674","mag":"3143957333"},"language":"en","primary_location":{"id":"doi:10.1145/3567674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3567674","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/292955427/3567674.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077490455","display_name":"Kevin Buchin","orcid":"https://orcid.org/0000-0002-3022-7877"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kevin Buchin","raw_affiliation_strings":["Department of Computer Science, TU Dortmund, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3022-7877","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028078173","display_name":"Alexander Hill","orcid":"https://orcid.org/0000-0002-9270-9871"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Hill","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9270-9871","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor Fekete","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9062-4241","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090048794","display_name":"Linda Kleist","orcid":"https://orcid.org/0000-0002-3786-916X"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Linda Kleist","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040775926","display_name":"Irina Kostitsyna","orcid":"https://orcid.org/0000-0003-0544-2257"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Irina Kostitsyna","raw_affiliation_strings":["Department of Mathematics & Computer Science, TU Eindhoven, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-0544-2257","affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073066645","display_name":"Dominik Krupke","orcid":"https://orcid.org/0000-0003-1573-3496"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik Krupke","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1573-3496","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004044891","display_name":"Roel Lambers","orcid":"https://orcid.org/0000-0002-0314-6094"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Roel Lambers","raw_affiliation_strings":["Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-0314-6094","affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001644472","display_name":"Martijn Struijs","orcid":"https://orcid.org/0000-0002-0116-7238"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Martijn Struijs","raw_affiliation_strings":["Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-0116-7238","affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00141876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/vertex-cover","display_name":"Vertex cover","score":0.8072384595870972},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7403407096862793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5913345217704773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5765026211738586},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5629183053970337},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4778846800327301},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4505772888660431},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.43933573365211487},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4376765787601471},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42558029294013977},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4255709648132324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32047855854034424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3059806227684021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24745586514472961}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8072384595870972},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7403407096862793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5913345217704773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5765026211738586},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5629183053970337},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4778846800327301},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4505772888660431},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.43933573365211487},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4376765787601471},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42558029294013977},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4255709648132324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32047855854034424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3059806227684021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24745586514472961},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3567674","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3567674","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/9dc68b85-1c06-468b-96cc-f876f6c40bb8","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9dc68b85-1c06-468b-96cc-f876f6c40bb8","pdf_url":"https://pure.tue.nl/ws/files/292955427/3567674.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buchin, K, Hill, A, Fekete, S, Kleist, L, Kostitsyna, I, Krupke, D, Lambers, R & Struijs, M 2022, 'Minimum Scan Cover and Variants : Theory and Experiments', Journal on Experimental Algorithmics, vol. 27, no. 3, 4.5. https://doi.org/10.1145/3567674","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/9dc68b85-1c06-468b-96cc-f876f6c40bb8","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85150062805&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buchin, K, Hill, A, Fekete, S, Kleist, L, Kostitsyna, I, Krupke, D, Lambers, R & Struijs, M 2022, 'Minimum Scan Cover and Variants : Theory and Experiments', Journal on Experimental Algorithmics, vol. 27, no. 3, 4.5. https://doi.org/10.1145/3567674","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/9dc68b85-1c06-468b-96cc-f876f6c40bb8","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/9dc68b85-1c06-468b-96cc-f876f6c40bb8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal on Experimental Algorithmics, 27(3):4.5. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/9dc68b85-1c06-468b-96cc-f876f6c40bb8","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9dc68b85-1c06-468b-96cc-f876f6c40bb8","pdf_url":"https://pure.tue.nl/ws/files/292955427/3567674.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buchin, K, Hill, A, Fekete, S, Kleist, L, Kostitsyna, I, Krupke, D, Lambers, R & Struijs, M 2022, 'Minimum Scan Cover and Variants : Theory and Experiments', Journal on Experimental Algorithmics, vol. 27, no. 3, 4.5. https://doi.org/10.1145/3567674","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.8199999928474426,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322958","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3143957333.pdf","grobid_xml":"https://content.openalex.org/works/W3143957333.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W87828068","https://openalex.org/W1833772674","https://openalex.org/W1961736623","https://openalex.org/W1984809851","https://openalex.org/W2000889179","https://openalex.org/W2005698341","https://openalex.org/W2046982002","https://openalex.org/W2049287714","https://openalex.org/W2060388851","https://openalex.org/W2074871661","https://openalex.org/W2146219471","https://openalex.org/W2157793635","https://openalex.org/W2160902740","https://openalex.org/W2166566648","https://openalex.org/W2167036627","https://openalex.org/W2399100674","https://openalex.org/W2576190712","https://openalex.org/W2750687229","https://openalex.org/W2887688500","https://openalex.org/W2908190952","https://openalex.org/W2940317904","https://openalex.org/W3037855705"],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2551034790","https://openalex.org/W2029933769","https://openalex.org/W2379188955","https://openalex.org/W1712180277","https://openalex.org/W2757966824","https://openalex.org/W2056597184","https://openalex.org/W1502438505","https://openalex.org/W2125212169","https://openalex.org/W1968988491"],"abstract_inverted_index":{"We":[0,222],"consider":[1],"a":[2,30,69,154,212],"spectrum":[3],"of":[4,41,51,68,76,127,182,215,254],"geometric":[5,242],"optimization":[6],"problems":[7],"motivated":[8],"by":[9],"contexts":[10],"such":[11],"as":[12],"satellite":[13],"communication":[14],"and":[15,131,160,168,184,206,228,233],"astrophysics.":[16],"In":[17,171],"the":[18,66,85,97,110,125,140,161,252],"problem":[19],"Minimum":[20,103,119,134],"Scan":[21,105,122,137],"Cover":[22,106,123,138],"with":[23,244],"Angular":[24],"Costs":[25],",":[26],"we":[27,174,198,210,250],"are":[28,115],"given":[29],"graph":[31,158],"G":[32,42],"that":[33,81,95],"is":[34,82,91,109],"embedded":[35],"in":[36,74,102,118,133,196],"Euclidean":[37],"space.":[38],"The":[39],"edges":[40,114],"need":[43,60],"to":[44,61,84,92,157,166,236,246],"be":[45],"scanned,":[46],"i.e.,":[47],"probed":[48],"from":[49],"both":[50,204],"their":[52,56],"vertices.":[53],"To":[54],"scan":[55],"edge,":[57],"two":[58,229],"vertices":[59],"face":[62],"each":[63],"other;":[64],"changing":[65],"heading":[67],"vertex":[70],"incurs":[71],"some":[72],"cost":[73],"terms":[75],"energy":[77],"or":[78],"rotation":[79,87,129,143],"time":[80,111],"proportional":[83],"corresponding":[86],"angle.":[88],"Our":[89],"goal":[90],"compute":[93,237],"schedules":[94],"minimize":[96],"following":[98],"objective":[99],"functions:":[100],"(i)":[101],"Makespan":[104],"(MSC-MS),":[107],"this":[108,172],"until":[112],"all":[113,128,219],"scanned;":[116],"(ii)":[117],"Total":[120],"Energy":[121,136],"(MSC-TE),":[124],"sum":[126],"angles;":[130],"(iii)":[132],"Bottleneck":[135],"(MSC-BE),":[139],"maximum":[141],"total":[142],"angle":[144],"at":[145],"one":[146],"vertex.":[147],"Previous":[148],"theoretical":[149],"work":[150],"on":[151],"MSC-MS":[152],"revealed":[153],"close":[155],"connection":[156],"coloring":[159],"cut":[162],"cover":[163],"problem,":[164],"leading":[165],"hardness":[167],"approximability":[169],"results.":[170],"article,":[173],"present":[175],"polynomial-time":[176],"algorithms":[177,202],"for":[178,189,203,218,241,257],"one-dimensional":[179],"(1D)":[180],"instances":[181,243],"MSC-TE":[183,205],"MSC-BE":[185],"but":[186],"NP-hardness":[187],"proofs":[188],"bipartite":[190,194],"2D":[191],"instances.":[192,260],"For":[193],"graphs":[195],"2D,":[197],"also":[199],"give":[200],"2-approximation":[201],"MSC-BE.":[207],"Most":[208],"importantly,":[209],"provide":[211],"comprehensive":[213],"study":[214],"practical":[216],"methods":[217],"three":[220,224],"problems.":[221],"compare":[223,251],"different":[225,255],"mixed-integer":[226],"programming":[227,231],"constraint":[230],"approaches":[232],"show":[234],"how":[235],"provably":[238],"optimal":[239],"solutions":[240],"up":[245],"300":[247],"edges.":[248],"Additionally,":[249],"performance":[253],"meta-heuristics":[256],"even":[258],"larger":[259]},"counts_by_year":[],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}