{"id":"https://openalex.org/W2055669150","doi":"https://doi.org/10.1017/s0956796801004038","title":"Maximum marking problems","display_name":"Maximum marking problems","publication_year":2001,"publication_date":"2001-07-01","ids":{"openalex":"https://openalex.org/W2055669150","doi":"https://doi.org/10.1017/s0956796801004038","mag":"2055669150"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796801004038","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796801004038","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068829812","display_name":"Richard Bird","orcid":null},"institutions":[{"id":"https://openalex.org/I2802123492","display_name":"Oxford Research Group","ror":"https://ror.org/00z4w4f29","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2802123492"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"RICHARD S. BIRD","raw_affiliation_strings":["Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford OX1 3QD, UK","Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford OX1 3QD, UK","institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"]},{"raw_affiliation_string":"Programming Research Group, Oxford University, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK","institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068829812"],"corresponding_institution_ids":["https://openalex.org/I2802123492","https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":3.2047,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91632383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"4","first_page":"411","last_page":"424"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6470131874084473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6059618592262268},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5454685091972351},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5225857496261597},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5003066062927246},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.50003981590271},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48872947692871094},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.44137176871299744},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4354844093322754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39910975098609924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34629321098327637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32063618302345276},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.29760271310806274},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07603690028190613},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06622782349586487}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6470131874084473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6059618592262268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5454685091972351},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5225857496261597},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5003066062927246},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.50003981590271},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48872947692871094},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.44137176871299744},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4354844093322754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39910975098609924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34629321098327637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32063618302345276},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.29760271310806274},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07603690028190613},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06622782349586487},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0956796801004038","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796801004038","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:05c8d269-29ed-4f33-86ab-41db0f499906","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:05c8d269-29ed-4f33-86ab-41db0f499906","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1507693023","https://openalex.org/W2020080707","https://openalex.org/W2143566245"],"related_works":["https://openalex.org/W2107381954","https://openalex.org/W1985727224","https://openalex.org/W2902549273","https://openalex.org/W2981001626","https://openalex.org/W2382364329","https://openalex.org/W2117536196","https://openalex.org/W4244673516","https://openalex.org/W2022598760","https://openalex.org/W2486717996","https://openalex.org/W2357738827"],"abstract_inverted_index":{"Here":[0],"are":[1,71,100,129,214],"two":[2,80],"puzzles":[3,213,283],"for":[4,280],"you":[5,58,65,70,138,150,270],"to":[6,74,164,170,190,211],"solve.":[7],"First,":[8],"consider":[9],"the":[10,34,41,44,62,87,96,103,122,133,140,145,154,160,167,172,175,185,198,217,220,228,232,250,253,265,282],"binary":[11],"tree":[12,105,111,114],"in":[13,36,86,132,239],"figure":[14,107],"1.":[15,165],"Take":[16],"a":[17,38,67,113,205,241,244,277],"pencil":[18],"(I":[19],"am":[20],"assuming":[21],"that":[22,40,57,125,243,274],"this":[23,268],"is":[24,49,56,92,112,169,201,227,247,259,276],"your":[25],"personal":[26],"copy":[27],"of":[28,33,43,46,106,121,174,208,219,230,234,252,267],"JFP!)":[29],"and":[30,98,144,157,197,249],"mark":[31,60,66,75,139,153,191],"some":[32,120,235],"nodes":[35,48,82,123,128],"such":[37,240],"way":[39,242],"sum":[42,173,200,251],"values":[45,155,182,254],"marked":[47,81,127,176,257],"as":[50,52,260,262],"large":[51,261],"possible.":[53,263],"The":[54,89,222],"catch":[55],"cannot":[59],"all":[61,126,181,192],"nodes:":[63],"if":[64,137,180],"node,":[68],"then":[69,149],"not":[72],"allowed":[73],"its":[76],"parent.":[77],"Equivalently,":[78],"no":[79],"can":[83],"be":[84,189,272],"contiguous":[85,131],"tree.":[88,134],"second":[90],"puzzle":[91],"similar":[93],"though":[94],"both":[95,212,281],"datatype":[97],"constraint":[99,246],"different.":[101],"Consider":[102],"rose":[104,110],"2":[108],"(a":[109],"with":[115,256],"arbitrary":[116],"branching":[117],"structure).":[118],"Mark":[119],"so":[124],"now":[130],"For":[135],"example,":[136],"root":[141],"value":[142,147],"4":[143,163],"leaf":[146],"1,":[148],"must":[151],"also":[152],"5":[156],"\u22123":[158],"along":[159],"path":[161],"from":[162],"Again":[166],"idea":[168],"maximise":[171],"nodes.":[177,193],"Of":[178],"course,":[179],"were":[183],"nonnegative,":[184],"best":[186],"solution":[187,279],"would":[188],"But":[194],"they":[195],"aren't":[196],"maximum":[199],"obtained":[202],"only":[203],"by":[204],"judicious":[206],"choice":[207],"marking.":[209],"Answers":[210],"given":[215,236,245],"at":[216],"end":[218,266],"paper.":[221],"Maximum":[223],"Marking":[224],"Problem":[225],"(MMP)":[226],"problem":[229],"marking":[231],"entries":[233,258],"data":[237],"structure":[238],"satisfied":[248],"associated":[255],"By":[264],"pearl,":[269],"will":[271],"convinced":[273],"there":[275],"linear-time":[278],"described":[284],"above.":[285]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2025-10-10T00:00:00"}