{"id":"https://openalex.org/W2068452881","doi":"https://doi.org/10.1007/s00453-009-9377-1","title":"An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem","display_name":"An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem","publication_year":2009,"publication_date":"2009-12-15","ids":{"openalex":"https://openalex.org/W2068452881","doi":"https://doi.org/10.1007/s00453-009-9377-1","mag":"2068452881"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9377-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9377-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5037511746","display_name":"Maxim A. Babenko","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]},{"id":"https://openalex.org/I58957048","display_name":"Yandex (Russia)","ror":"https://ror.org/04dbch786","country_code":"RU","type":"company","lineage":["https://openalex.org/I58957048"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Maxim A. Babenko","raw_affiliation_strings":["Dept. of Mechanics and Mathematics, Moscow State University, Yandex LLC, Russia","Moscow State University, Dept. of Mechanics and Mathematics, Yandex LLC, Russia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mechanics and Mathematics, Moscow State University, Yandex LLC, Russia","institution_ids":["https://openalex.org/I19880235","https://openalex.org/I58957048"]},{"raw_affiliation_string":"Moscow State University, Dept. of Mechanics and Mathematics, Yandex LLC, Russia#TAB#","institution_ids":["https://openalex.org/I19880235"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037511746"],"corresponding_institution_ids":["https://openalex.org/I19880235","https://openalex.org/I58957048"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1258157,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"61","issue":"4","first_page":"898","last_page":"922"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9966999888420105,"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.7967034578323364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7281357645988464},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6223530769348145},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6176729798316956},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.601608157157898},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5547811985015869},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5409506559371948},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.47299036383628845},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46812641620635986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40191635489463806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.293768048286438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29053542017936707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09599068760871887},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06515774130821228}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7967034578323364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7281357645988464},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6223530769348145},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6176729798316956},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.601608157157898},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5547811985015869},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5409506559371948},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.47299036383628845},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46812641620635986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40191635489463806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.293768048286438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29053542017936707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09599068760871887},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06515774130821228},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-009-9377-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9377-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1583617948","https://openalex.org/W1584407913","https://openalex.org/W1969357318","https://openalex.org/W1981318539","https://openalex.org/W1981881379","https://openalex.org/W1982512167","https://openalex.org/W2001274023","https://openalex.org/W2018804864","https://openalex.org/W2071350251","https://openalex.org/W2084224084","https://openalex.org/W2091299439","https://openalex.org/W2104374700","https://openalex.org/W2340149117","https://openalex.org/W2752573522","https://openalex.org/W3014094413","https://openalex.org/W3145128584","https://openalex.org/W4246185962","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W2151412766","https://openalex.org/W103840660","https://openalex.org/W4301055422","https://openalex.org/W2408555533"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}