{"id":"https://openalex.org/W2783336934","doi":"https://doi.org/10.1007/s10878-020-00641-w","title":"Online maximum matching with recourse","display_name":"Online maximum matching with recourse","publication_year":2020,"publication_date":"2020-09-03","ids":{"openalex":"https://openalex.org/W2783336934","doi":"https://doi.org/10.1007/s10878-020-00641-w","mag":"2783336934"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-020-00641-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-020-00641-w","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1801.03462","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107303715","display_name":"Spyros Angelopoulos","orcid":"https://orcid.org/0000-0001-9819-9158"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Spyros Angelopoulos","raw_affiliation_strings":["Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","RO - Recherche Op\u00e9rationnelle (France)"],"raw_orcid":"https://orcid.org/0000-0001-9819-9158","affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159731"]},{"raw_affiliation_string":"RO - Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029270613","display_name":"Christoph D\u00fcrr","orcid":"https://orcid.org/0000-0001-8103-5333"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christoph D\u00fcrr","raw_affiliation_strings":["Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","RO - Recherche Op\u00e9rationnelle (France)"],"raw_orcid":"https://orcid.org/0000-0001-8103-5333","affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159731"]},{"raw_affiliation_string":"RO - Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085460281","display_name":"Shendan Jin","orcid":"https://orcid.org/0000-0003-1218-9085"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Shendan Jin","raw_affiliation_strings":["Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","RO - Recherche Op\u00e9rationnelle (France)"],"raw_orcid":"https://orcid.org/0000-0003-1218-9085","affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159731"]},{"raw_affiliation_string":"RO - Recherche Op\u00e9rationnelle (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5107303715"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159731"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.5365,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.68949071,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"40","issue":"4","first_page":"974","last_page":"1007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"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/T11182","display_name":"Auction Theory and Applications","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.682533860206604},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6229591965675354},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6131754517555237},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5723927617073059},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5379942059516907},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5163384675979614},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.48749470710754395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4775084853172302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45840883255004883},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.43906843662261963},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43610626459121704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43150511384010315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4304550290107727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3700815439224243},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.145430326461792},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0776529610157013},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0687921941280365}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.682533860206604},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6229591965675354},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6131754517555237},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5723927617073059},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5379942059516907},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5163384675979614},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.48749470710754395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4775084853172302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45840883255004883},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43906843662261963},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43610626459121704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43150511384010315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4304550290107727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3700815439224243},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.145430326461792},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0776529610157013},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0687921941280365},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s10878-020-00641-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-020-00641-w","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.03462","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.03462","pdf_url":"https://arxiv.org/pdf/1801.03462","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":"pmh:oai:HAL:hal-02980298v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-02980298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1382-6905","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-02986679v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02986679","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 2020, 40 (4), pp.974-1007. ⟨10.1007/s10878-020-00641-w⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00641-w","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-020-00641-w","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":"doi:10.4230/lipics.mfcs.2018.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2018.8","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1801.03462","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.03462","pdf_url":"https://arxiv.org/pdf/1801.03462","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3194597172","display_name":"Online Algorithms Beyond Traditional Approaches","funder_award_id":"ANR-15-CE40-0015","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1514601641","https://openalex.org/W1514707655","https://openalex.org/W1552828154","https://openalex.org/W1583926746","https://openalex.org/W1589175915","https://openalex.org/W1590242304","https://openalex.org/W1957112841","https://openalex.org/W1968997853","https://openalex.org/W2162656786","https://openalex.org/W2183531780","https://openalex.org/W2259315298","https://openalex.org/W2296273994","https://openalex.org/W2469267808","https://openalex.org/W2611885862","https://openalex.org/W2759628670","https://openalex.org/W2796781808","https://openalex.org/W2952999756","https://openalex.org/W2962906928","https://openalex.org/W2963961281","https://openalex.org/W3098705741","https://openalex.org/W4206501214","https://openalex.org/W4247154108","https://openalex.org/W4247656554"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,12,37,44,49,58,65,91,110,122,135,143,155,165,168,177,180,188,214,232,252,263,268,274,315],"online":[3,23,95,279],"maximum":[4],"matching":[5,33,59,181,280],"problem":[6,27,85],"in":[7,10,90,147,291],"a":[8,17,31,81,297],"model":[9],"which":[11,148,217,272],"edges":[13,35],"are":[14,40],"associated":[15],"with":[16,98,281],"known":[18,253],"recourse":[19,99],"parameter":[20],"k.":[21,205],"An":[22],"algorithm":[24,50,169,190,216,233,245],"for":[25,195,202,225,304],"this":[26,139,292],"has":[28,191],"to":[29,53,61,267],"maintain":[30],"valid":[32],"while":[34],"of":[36,93,121,138,167,171,179,213,228,237,256,262,278,285,300],"underlying":[38],"graph":[39],"presented":[41],"one":[42],"after":[43],"other.":[45],"At":[46],"any":[47],"moment":[48],"can":[51],"decide":[52],"include":[54],"an":[55,149,161,211],"edge":[56,74,144,151,269],"into":[57],"or":[60],"exclude":[62],"it,":[63],"under":[64],"restriction":[66],"that":[67,187,224,242],"at":[68],"most":[69],"k":[70,78,198,229],"such":[71],"actions":[72],"per":[73],"take":[75],"place,":[76],"where":[77],"is":[79,265,273,318],"typically":[80],"small":[82,226],"constant.":[83],"This":[84],"was":[86,114],"introduced":[87],"and":[88,127,199,209,221,287],"studied":[89,115],"context":[92],"general":[94],"packing":[96],"problems":[97],"by":[100,116,175],"Avitabile":[101,172],"et":[102,118,173],"al.":[103,119],"(Inf":[104],"Process":[105],"Lett":[106],"113(3):81\u201386,":[107],"2013),":[108],"whereas":[109],"special":[111],"case":[112],"$$k=2$$":[113],"Boyar":[117],"(Proceedings":[120],"15th":[123],"workshop":[124],"on":[125,164],"algorithms":[126],"data":[128],"structures":[129],"(WADS),":[130],"pp":[131],"217\u2013228,":[132],"2017).":[133],"In":[134,183,235],"first":[136,159],"part":[137,261],"paper":[140,264],"we":[141,158,185,207,218,222,240,295],"consider":[142],"arrival":[145],"model,":[146,271],"arriving":[150],"never":[152],"disappears":[153],"from":[154],"graph.":[156],"Here,":[157],"show":[160,186,223,241,296],"improved":[162],"analysis":[163,284],"performance":[166],"AMP":[170,288],"al.,":[174],"exploiting":[176],"structure":[178],"problem.":[182],"addition,":[184],"greedy":[189,215],"competitive":[192,316],"ratio":[193,200,317],"3/2":[194],"every":[196,203],"even":[197,306],"2":[201],"odd":[204],"Moreover,":[206],"present":[208],"analyze":[210],"improvement":[212],"call":[219],"L-Greedy,":[220],"values":[227],"it":[230],"outperforms":[231],"AMP.":[234],"terms":[236],"lower":[238,254,298],"bounds,":[239],"no":[243],"deterministic":[244],"better":[246],"than":[247],"$$1+1/(k-1)$$":[248],"exists,":[249],"improving":[250],"upon":[251],"bound":[255,299],"$$1+1/k$$":[257],".":[258,310],"The":[259,283],"second":[260],"devoted":[266],"arrival/departure":[270],"fully":[275],"dynamic":[276],"variant":[277],"recourse.":[282],"L-Greedy":[286],"carry":[289],"through":[290],"model;":[293],"moreover":[294],"$$(k^2-3k+6)":[301],"/":[302],"(k^2-4k+7)$$":[303],"all":[305],"$$k":[307],"\\ge":[308],"4$$":[309],"For":[311],"$$k\\in":[312],"\\{2,3\\}$$":[313],",":[314],"3/2.":[319]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}