{"id":"https://openalex.org/W1855229140","doi":"https://doi.org/10.1007/978-3-540-74456-6_40","title":"A Linear Time Algorithm for the k Maximal Sums Problem","display_name":"A Linear Time Algorithm for the k Maximal Sums Problem","publication_year":2007,"publication_date":"2007-08-14","ids":{"openalex":"https://openalex.org/W1855229140","doi":"https://doi.org/10.1007/978-3-540-74456-6_40","mag":"1855229140"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74456-6_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_40","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark","BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]},{"raw_affiliation_string":"BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark#TAB#","institution_ids":["https://openalex.org/I4210095128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059649268","display_name":"Allan Gr\u00f8nlund J\u00f8rgensen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Allan Gr\u00f8nlund J\u00f8rgensen","raw_affiliation_strings":["BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark","BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]},{"raw_affiliation_string":"BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark#TAB#","institution_ids":["https://openalex.org/I4210095128"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039943336"],"corresponding_institution_ids":["https://openalex.org/I4210095128"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1431,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.80934741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"442","last_page":"453"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9990000128746033,"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/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/algorithm","display_name":"Algorithm","score":0.5133604407310486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43409720063209534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40556231141090393}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5133604407310486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43409720063209534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40556231141090393}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-74456-6_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_40","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.4202","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.4202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/~gerth/Papers/mfcs07sum.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/43737830-9d8e-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/43737830-9d8e-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S & J\u00f8rgensen, A G 2007, A Linear Time Algorithm for the k Maximal Sums Problem. in L Kucera & A Kucera (eds), Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007 Cesk\u00fd Krumlov, Czech Republic, August 26-31, 2007 Proceedings. Springer, Lecture Notes in Computer Science, vol. 4708, pp. 442-453, 32nd International Symposium on Mathematical Foundations of Computer Science, Cesky Krumlov, Czech Republic, 26/08/2007. https://doi.org/10.1007/978-3-540-74456-6_40","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1496856923","https://openalex.org/W1499500364","https://openalex.org/W1506292197","https://openalex.org/W1600795850","https://openalex.org/W1606278142","https://openalex.org/W1996641400","https://openalex.org/W2008252807","https://openalex.org/W2009419163","https://openalex.org/W2009992143","https://openalex.org/W2060164640","https://openalex.org/W2060919812","https://openalex.org/W2065503744","https://openalex.org/W2076768231","https://openalex.org/W2101506819","https://openalex.org/W2111340560","https://openalex.org/W2125962775","https://openalex.org/W2130154383","https://openalex.org/W2131058166","https://openalex.org/W2142947709","https://openalex.org/W2146103868","https://openalex.org/W2171589207","https://openalex.org/W2914771821","https://openalex.org/W3198160809","https://openalex.org/W3198470706","https://openalex.org/W4213048098","https://openalex.org/W4235038029","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}