{"id":"https://openalex.org/W3158676953","doi":"https://doi.org/10.1007/s10479-021-04127-8","title":"Matchings under distance constraints I.","display_name":"Matchings under distance constraints I.","publication_year":2021,"publication_date":"2021-06-28","ids":{"openalex":"https://openalex.org/W3158676953","doi":"https://doi.org/10.1007/s10479-021-04127-8","mag":"3158676953"},"language":"lv","primary_location":{"id":"doi:10.1007/s10479-021-04127-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-021-04127-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-021-04127-8.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10479-021-04127-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004973270","display_name":"P\u00e9ter Madarasi","orcid":"https://orcid.org/0000-0003-4574-337X"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"P\u00e9ter Madarasi","raw_affiliation_strings":["Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary","E\u00f6tv\u00f6s Lor\u00e1nd University"],"raw_orcid":"https://orcid.org/0000-0003-4574-337X","affiliations":[{"raw_affiliation_string":"Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"E\u00f6tv\u00f6s Lor\u00e1nd University","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004973270"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08924495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"305","issue":"1-2","first_page":"137","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7828721404075623},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7265843749046326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7209962010383606},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.701724648475647},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5758028030395508},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5149972438812256},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49185943603515625},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44860294461250305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4475468397140503},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43384936451911926},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42792075872421265},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4146701395511627},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41267669200897217},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3211239278316498},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21599876880645752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12356677651405334}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7828721404075623},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7265843749046326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7209962010383606},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.701724648475647},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5758028030395508},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5149972438812256},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49185943603515625},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44860294461250305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4475468397140503},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43384936451911926},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42792075872421265},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4146701395511627},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41267669200897217},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3211239278316498},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21599876880645752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12356677651405334},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s10479-021-04127-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-021-04127-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-021-04127-8.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1911.12432","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.12432","pdf_url":"https://arxiv.org/pdf/1911.12432","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3158676953","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1911.12432.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:RePEc:spr:annopr:v:305:y:2021:i:1:d:10.1007_s10479-021-04127-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10479-021-04127-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:edit.elte.hu:10831/82803","is_oa":true,"landing_page_url":"http://hdl.handle.net/10831/82803","pdf_url":null,"source":{"id":"https://openalex.org/S4306400126","display_name":"ELTE Digital Institutional Repository (EDIT) (E\u00f6tv\u00f6s Lor\u00e1nd University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I106118109","host_organization_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","host_organization_lineage":["https://openalex.org/I106118109"],"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":"","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1911.12432","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1911.12432","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s10479-021-04127-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10479-021-04127-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10479-021-04127-8.pdf","source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3874944817","display_name":null,"funder_award_id":"\u00daNKP-20-3","funder_id":"https://openalex.org/F4320328991","funder_display_name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium"},{"id":"https://openalex.org/G5511846599","display_name":null,"funder_award_id":"\u00daNKP-20","funder_id":"https://openalex.org/F4320335908","funder_display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap"}],"funders":[{"id":"https://openalex.org/F4320326124","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd Tudom\u00e1nyegyetem","ror":"https://ror.org/01jsq2704"},{"id":"https://openalex.org/F4320328991","display_name":"Innov\u00e1ci\u00f3s \u00e9s Technol\u00f3giai Miniszt\u00e9rium","ror":"https://ror.org/02ey3ab96"},{"id":"https://openalex.org/F4320335908","display_name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3158676953.pdf","grobid_xml":"https://content.openalex.org/works/W3158676953.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1522552921","https://openalex.org/W2000304327","https://openalex.org/W2027758271","https://openalex.org/W2073506427","https://openalex.org/W2078396000","https://openalex.org/W2116087731","https://openalex.org/W2141082967","https://openalex.org/W2150154671","https://openalex.org/W2401610261","https://openalex.org/W2913688336","https://openalex.org/W2944540875","https://openalex.org/W2966046296","https://openalex.org/W3044227497","https://openalex.org/W3149604617","https://openalex.org/W6657660987"],"related_works":["https://openalex.org/W154567010","https://openalex.org/W3021188966","https://openalex.org/W1989856784","https://openalex.org/W2960785177","https://openalex.org/W2088168571","https://openalex.org/W2951522903","https://openalex.org/W2121472099","https://openalex.org/W3089108840","https://openalex.org/W2123734400","https://openalex.org/W2754038687","https://openalex.org/W2944918303","https://openalex.org/W2963142939","https://openalex.org/W3004704848","https://openalex.org/W2022490362","https://openalex.org/W2738162363","https://openalex.org/W2172162445","https://openalex.org/W2950509221","https://openalex.org/W2770160826","https://openalex.org/W2572273493","https://openalex.org/W2042977557"],"abstract_inverted_index":{"Abstract":[0],"This":[1,162],"paper":[2],"introduces":[3],"the":[4,62,101,104,109,175,198,201,222,226,259,263,331,339,342,346],"d":[5,193],"-":[6],"distance":[7],"matching":[8],"problem":[9,176],",":[10,57,122,145,251],"in":[11,120,168,179,210,330,338],"which":[12],"we":[13,219],"are":[14,290],"given":[15],"a":[16,58,87,183,293],"bipartite":[17],"graph":[18],"$$G=(S,T;E)$$":[19],"<mml:math":[20,37,70,92,127,149,235,269,307,322],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[21,38,71,93,128,150,236,270,308,323],"<mml:mrow>":[22,39,72,94,129,151,237,242,271,309,324],"<mml:mi>G</mml:mi>":[23],"<mml:mo>=</mml:mo>":[24,41],"<mml:mo>(</mml:mo>":[25,272],"<mml:mi>S</mml:mi>":[26,40],"<mml:mo>,</mml:mo>":[27,47,49,135],"<mml:mi>T</mml:mi>":[28],"<mml:mo>\u037e</mml:mo>":[29],"<mml:mi>E</mml:mi>":[30,97],"<mml:mo>)</mml:mo>":[31,279],"</mml:mrow>":[32,55,79,98,143,159,247,249,280,315,328],"</mml:math>":[33,56,80,99,144,160,250,281,316,329],"with":[34,262],"$$S=\\{s_1,\\dots":[35],",s_n\\}$$":[36],"<mml:mo>{</mml:mo>":[42],"<mml:msub>":[43,50,75,130,136],"<mml:mi>s</mml:mi>":[44,51,131,137],"<mml:mn>1</mml:mn>":[45,241,246,276],"</mml:msub>":[46,53,78,133,139],"<mml:mo>\u22ef</mml:mo>":[48],"<mml:mi>n</mml:mi>":[52],"<mml:mo>}</mml:mo>":[54],"weight":[59],"function":[60],"on":[61],"edges":[63,102],"and":[64,181,194,252,292,345],"an":[65,188,214,254,301],"integer":[66,228],"$$d\\in":[67],"\\mathbb":[68],"Z_+$$":[69],"<mml:mi>d</mml:mi>":[73,158,244,277],"<mml:mo>\u2208</mml:mo>":[74,141],"<mml:mi>Z</mml:mi>":[76],"<mml:mo>+</mml:mo>":[77,313],".":[81,161],"The":[82,334],"goal":[83],"is":[84,116,177,205,231,284,297],"to":[85],"find":[86],"maximum-weight":[88],"subset":[89],"$$M\\subseteq":[90],"E$$":[91],"<mml:mi>M</mml:mi>":[95,142],"<mml:mo>\u2286</mml:mo>":[96],"of":[100,111,114,203,217,225,304,341,349,355],"satisfying":[103],"following":[105],"two":[106],"conditions:":[107],"(i)":[108],"degree":[110],"every":[112],"node":[113],"S":[115],"at":[117,232],"most":[118,233],"one":[119],"M":[121],"(ii)":[123],"if":[124],"$$s_it,s_jt\\in":[125],"M$$":[126],"<mml:mi>i</mml:mi>":[132,155],"<mml:mi>t</mml:mi>":[134,140],"<mml:mi>j</mml:mi>":[138,153],"then":[146],"$$|j-i|\\ge":[147],"d$$":[148],"<mml:mo>|</mml:mo>":[152,156],"<mml:mo>-</mml:mo>":[154,239,245,274],"<mml:mo>\u2265</mml:mo>":[157],"question":[163],"arises":[164],"naturally,":[165],"for":[166,258,317],"example,":[167],"various":[169],"scheduling":[170],"problems.":[171],"We":[172,186],"show":[173,196,220],"that":[174,197,221,299],"NP-complete":[178],"general":[180],"admits":[182],"simple":[184],"3-approximation.":[185],"give":[187,253],"FPT":[189],"algorithm":[190,257,283,296],"parameterized":[191],"by":[192],"also":[195,285],"case":[199,261],"when":[200],"size":[202],"T":[204],"constant":[206,319],"can":[207],"be":[208,354],"solved":[209],"polynomial":[211],"time.":[212],"From":[213],"approximability":[215],"point":[216],"view,":[218],"integrality":[223,343],"gap":[224,344],"natural":[227],"programming":[229],"model":[230],"$$2-\\frac{1}{2d-1}$$":[234],"<mml:mn>2</mml:mn>":[238,243,273,312],"<mml:mfrac>":[240,275],"</mml:mfrac>":[248,278],"LP-based":[255],"approximation":[256,302,347],"weighted":[260],"same":[264],"guarantee.":[265],"A":[266],"combinatorial":[267,357],"$$(2-\\frac{1}{d})$$":[268],"-approximation":[282],"presented.":[286],"Several":[287],"greedy":[288],"approaches":[289,336],"considered,":[291],"local":[294],"search":[295],"described":[298],"achieves":[300],"ratio":[303,348],"$$3/2+\\epsilon":[305],"$$":[306],"<mml:mn>3</mml:mn>":[310],"<mml:mo>/</mml:mo>":[311],"<mml:mi>\u03f5</mml:mi>":[314,325],"any":[318],"$$\\epsilon":[320],"&gt;0$$":[321],"<mml:mo>&gt;</mml:mo>":[326],"<mml:mn>0</mml:mn>":[327],"unweighted":[332],"case.":[333],"novel":[335],"used":[337],"analysis":[340],"locally":[350],"optimal":[351],"solutions":[352],"might":[353],"independent":[356],"interest.":[358]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}