Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2019062750', 'doi': 'https://doi.org/10.1007/bf02523685', 'title': 'Primal-dual approximation algorithms for integral flow and multicut in trees', 'display_name': 'Primal-dual approximation algorithms for integral flow and multicut in trees', 'publication_year': 1997, 'publication_date': '1997-05-01', 'ids': {'openalex': 'https://openalex.org/W2019062750', 'doi': 'https://doi.org/10.1007/bf02523685', 'mag': '2019062750'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/bf02523685', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5045952512', 'display_name': 'Naveen Garg', 'orcid': 'https://orcid.org/0000-0001-7923-4464'}, 'institutions': [{'id': 'https://openalex.org/I64295750', 'display_name': 'Indian Institute of Technology Indore', 'ror': 'https://ror.org/01hhf7w52', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I64295750']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'N. Garg', 'raw_affiliation_strings': ['[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]'], 'affiliations': [{'raw_affiliation_string': '[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]', 'institution_ids': ['https://openalex.org/I64295750']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5007368382', 'display_name': 'Vijay V. Vazirani', 'orcid': 'https://orcid.org/0000-0002-4106-9077'}, 'institutions': [{'id': 'https://openalex.org/I64295750', 'display_name': 'Indian Institute of Technology Indore', 'ror': 'https://ror.org/01hhf7w52', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I64295750']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'V. V. Vazirani', 'raw_affiliation_strings': ['[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]'], 'affiliations': [{'raw_affiliation_string': '[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]', 'institution_ids': ['https://openalex.org/I64295750']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5043084405', 'display_name': 'Mihalis Yannakakis', 'orcid': 'https://orcid.org/0000-0003-2857-1860'}, 'institutions': [{'id': 'https://openalex.org/I72090969', 'display_name': 'Nokia (United States)', 'ror': 'https://ror.org/038km2573', 'country_code': 'US', 'type': 'company', 'lineage': ['https://openalex.org/I2738502077', 'https://openalex.org/I72090969']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'M. Yannakakis', 'raw_affiliation_strings': ['AT&T Bell Laboratories, Murray Hill, USA 07974#TAB#'], 'affiliations': [{'raw_affiliation_string': 'AT&T Bell Laboratories, Murray Hill, USA 07974#TAB#', 'institution_ids': ['https://openalex.org/I72090969']}]}], 'institution_assertions': [], 'countries_distinct_count': 2, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': {'value': 2290, 'currency': 'EUR', 'value_usd': 2890, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 4.281, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 382, 'citation_normalized_percentile': {'value': 0.987314, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 99, 'max': 100}, 'biblio': {'volume': '18', 'issue': '1', 'first_page': '3', 'last_page': '20'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9998, '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/T10720', 'display_name': 'Combinatorial Optimization and Complexity Theory', 'score': 0.9998, '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/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9995, '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/T12288', 'display_name': 'Distributed Coordination in Online Robotics Research', 'score': 0.995, '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/parameterized-complexity', 'display_name': 'Parameterized Complexity', 'score': 0.551153}, {'id': 'https://openalex.org/keywords/theory-of-computation', 'display_name': 'Theory of computation', 'score': 0.5465481}, {'id': 'https://openalex.org/keywords/constraint-satisfaction-problems', 'display_name': 'Constraint Satisfaction Problems', 'score': 0.534531}, {'id': 'https://openalex.org/keywords/approximation-algorithms', 'display_name': 'Approximation Algorithms', 'score': 0.531328}, {'id': 'https://openalex.org/keywords/combinatorial-optimization', 'display_name': 'Combinatorial Optimization', 'score': 0.525064}, {'id': 'https://openalex.org/keywords/multi-commodity-flow-problem', 'display_name': 'Multi-commodity flow problem', 'score': 0.49721292}, {'id': 'https://openalex.org/keywords/maximum-flow-problem', 'display_name': 'Maximum flow problem', 'score': 0.49051827}, {'id': 'https://openalex.org/keywords/vertex-cover', 'display_name': 'Vertex cover', 'score': 0.4367804}], 'concepts': [{'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.8260193}, {'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.5520624}, {'id': 'https://openalex.org/C24858836', 'wikidata': 'https://www.wikidata.org/wiki/Q844718', 'display_name': 'Theory of computation', 'level': 2, 'score': 0.5465481}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5124603}, {'id': 'https://openalex.org/C38349280', 'wikidata': 'https://www.wikidata.org/wiki/Q1434290', 'display_name': 'Flow (mathematics)', 'level': 2, 'score': 0.50324124}, {'id': 'https://openalex.org/C170334043', 'wikidata': 'https://www.wikidata.org/wiki/Q6934437', 'display_name': 'Multi-commodity flow problem', 'level': 3, 'score': 0.49721292}, {'id': 'https://openalex.org/C157469704', 'wikidata': 'https://www.wikidata.org/wiki/Q2585642', 'display_name': 'Maximum flow problem', 'level': 2, 'score': 0.49051827}, {'id': 'https://openalex.org/C40687702', 'wikidata': 'https://www.wikidata.org/wiki/Q11515519', 'display_name': 'Vertex cover', 'level': 3, 'score': 0.4367804}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.41972205}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.38023853}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.29984927}, {'id': 'https://openalex.org/C114809511', 'wikidata': 'https://www.wikidata.org/wiki/Q1412924', 'display_name': 'Flow network', 'level': 2, 'score': 0.22048074}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.1455771}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.14364293}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1007/bf02523685', 'pdf_url': None, '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/P4310319965', 'https://openalex.org/P4310319900'], 'host_organization_lineage_names': ['Springer Nature', 'Springer Science+Business Media'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 32, 'referenced_works': ['https://openalex.org/W1480903797', 'https://openalex.org/W1500938493', 'https://openalex.org/W1523006294', 'https://openalex.org/W1527913068', 'https://openalex.org/W1544515183', 'https://openalex.org/W1551635709', 'https://openalex.org/W1572702333', 'https://openalex.org/W1985672402', 'https://openalex.org/W1986334784', 'https://openalex.org/W1990313671', 'https://openalex.org/W2001139415', 'https://openalex.org/W2003160050', 'https://openalex.org/W2005079828', 'https://openalex.org/W2008816808', 'https://openalex.org/W2020687920', 'https://openalex.org/W2031248452', 'https://openalex.org/W2038225707', 'https://openalex.org/W2044343300', 'https://openalex.org/W2059453880', 'https://openalex.org/W2064600658', 'https://openalex.org/W2069702698', 'https://openalex.org/W2093508305', 'https://openalex.org/W2100440346', 'https://openalex.org/W2117319425', 'https://openalex.org/W2125278290', 'https://openalex.org/W2143391442', 'https://openalex.org/W2148352980', 'https://openalex.org/W2152221184', 'https://openalex.org/W2152986618', 'https://openalex.org/W2170668134', 'https://openalex.org/W2599087550', 'https://openalex.org/W4299409673'], 'related_works': ['https://openalex.org/W3141113327', 'https://openalex.org/W3035974271', 'https://openalex.org/W2551034790', 'https://openalex.org/W2096382750', 'https://openalex.org/W2081642962', 'https://openalex.org/W2056597184', 'https://openalex.org/W2029933769', 'https://openalex.org/W1712180277', 'https://openalex.org/W1608414128', 'https://openalex.org/W159504299'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2019062750', 'counts_by_year': [{'year': 2024, 'cited_by_count': 5}, {'year': 2023, 'cited_by_count': 8}, {'year': 2022, 'cited_by_count': 14}, {'year': 2021, 'cited_by_count': 15}, {'year': 2020, 'cited_by_count': 15}, {'year': 2019, 'cited_by_count': 10}, {'year': 2018, 'cited_by_count': 18}, {'year': 2017, 'cited_by_count': 8}, {'year': 2016, 'cited_by_count': 10}, {'year': 2015, 'cited_by_count': 11}, {'year': 2014, 'cited_by_count': 16}, {'year': 2013, 'cited_by_count': 17}, {'year': 2012, 'cited_by_count': 19}], 'updated_date': '2024-09-17T15:24:55.042519', 'created_date': '2016-06-24'}