{"id":"https://openalex.org/W4409425795","doi":"https://doi.org/10.1007/s10878-025-01290-7","title":"On the parenthesisations of matrix chains: All are useful, few are essential","display_name":"On the parenthesisations of matrix chains: All are useful, few are essential","publication_year":2025,"publication_date":"2025-04-01","ids":{"openalex":"https://openalex.org/W4409425795","doi":"https://doi.org/10.1007/s10878-025-01290-7"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01290-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01290-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01290-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01290-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108232760","display_name":"Francisco Pelayo L\u00f3pez","orcid":"https://orcid.org/0000-0002-6406-0526"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Francisco L\u00f3pez","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-6406-0526","affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076622203","display_name":"Lars Karlsson","orcid":"https://orcid.org/0000-0002-4675-7434"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Lars Karlsson","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048393932","display_name":"Paolo Bientinesi","orcid":"https://orcid.org/0000-0002-4972-7097"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Paolo Bientinesi","raw_affiliation_strings":["Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Ume\u00e5 Universitet, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108232760"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.3257,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8084385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"49","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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/theory-of-computation","display_name":"Theory of computation","score":0.5665928721427917},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4497416615486145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4308616518974304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36858057975769043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3630011975765228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2300189733505249},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.14050811529159546}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5665928721427917},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4497416615486145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4308616518974304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36858057975769043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3630011975765228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2300189733505249},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.14050811529159546},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-025-01290-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01290-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01290-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-238200","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-238200","pdf_url":"https://umu.diva-portal.org/smash/get/diva2:1956464/FULLTEXT01","source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"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":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01290-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-025-01290-7","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"}],"best_oa_location":{"id":"doi:10.1007/s10878-025-01290-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01290-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01290-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409425795.pdf","grobid_xml":"https://content.openalex.org/works/W4409425795.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1987507258","https://openalex.org/W2028574474","https://openalex.org/W2033751470","https://openalex.org/W2041094700","https://openalex.org/W2085140829","https://openalex.org/W2114665465","https://openalex.org/W2793306607","https://openalex.org/W2963743473","https://openalex.org/W2971727418","https://openalex.org/W3101698470","https://openalex.org/W3150041682","https://openalex.org/W3173293533","https://openalex.org/W4238323774"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Abstract":[0],"The":[1,40],"product":[2],"of":[3,8,37,159,162,172],"a":[4,34,45,86],"matrix":[5],"chain":[6],"consisting":[7],"n":[9,74],"matrices":[10],"can":[11],"be":[12,84],"computed":[13],"in":[14,52,71,132,153],"$$C_{n-1}$$":[15],"<mml:math":[16,56,142],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[17,57,143],"<mml:msub>":[18],"<mml:mi>C</mml:mi>":[19],"<mml:mrow>":[20,58,144],"<mml:mi>n</mml:mi>":[21,61,63,145],"<mml:mo>-</mml:mo>":[22],"<mml:mn>1</mml:mn>":[23,147],"</mml:mrow>":[24,65,148],"</mml:msub>":[25],"</mml:math>":[26,66,149],"(Catalan\u2019s":[27],"number)":[28],"different":[29,107],"ways,":[30],"each":[31,127],"identified":[32],"by":[33],"distinct":[35],"parenthesisation":[36,46,128],"the":[38,49,91,117,133,154,157,183,191],"chain.":[39],"best":[41,92,118,184],"algorithm":[42,187],"to":[43,83,114],"select":[44],"that":[47,80,105,125,156,190],"minimises":[48],"cost":[50],"runs":[51],"$$O(n":[53],"\\log":[54],"n)$$":[55],"<mml:mi>O</mml:mi>":[59],"<mml:mo>(</mml:mo>":[60],"<mml:mo>log</mml:mo>":[62],"<mml:mo>)</mml:mo>":[64],"time.":[67],"Approximate":[68],"algorithms":[69],"run":[70],"O":[72],"(":[73],")":[75],"time":[76],"and":[77,109,136,188],"find":[78],"solutions":[79],"are":[81,151],"guaranteed":[82],"within":[85],"certain":[87],"factor":[88,93,193],"from":[89],"optimal;":[90],"is":[94,129,194],"currently":[95],"1.155.":[96],"In":[97],"this":[98],"article,":[99],"we":[100,123,180],"first":[101],"prove":[102],"two":[103],"results":[104,113],"characterise":[106],"parenthesisations,":[108,179],"then":[110],"use":[111],"those":[112],"improve":[115,181],"on":[116,177,182],"known":[119,185],"approximation":[120,186,192],"algorithms.":[121],"Specifically,":[122],"show":[124,189],"(a)":[126],"optimal":[130],"somewhere":[131],"problem":[134,173],"domain,":[135],"(b)":[137],"exactly":[138],"$$n":[139],"+":[140],"1$$":[141],"<mml:mo>+</mml:mo>":[146],"parenthesisations":[150],"essential":[152,178],"sense":[155],"removal":[158],"any":[160],"one":[161],"them":[163],"causes":[164],"an":[165,169],"unbounded":[166],"penalty":[167],"for":[168],"infinite":[170],"number":[171],"instances.":[174],"By":[175],"focusing":[176],"at":[195],"most":[196],"1.143.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}