Publication Information

{'id': 'https://openalex.org/W3010374802', 'doi': None, 'title': 'A constrained minimum spanning tree problem', 'display_name': 'A constrained minimum spanning tree problem', 'publication_year': 2018, 'publication_date': '2018-01-01', 'ids': {'openalex': 'https://openalex.org/W3010374802', 'mag': '3010374802'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://ideas.repec.org/p/ver/wpaper/08-2018.html', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306401271', 'display_name': 'RePEc: Research Papers in Economics', 'issn_l': None, 'issn': None, 'is_oa': True, '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': ['Federal Reserve Bank of St. Louis'], 'type': 'repository'}, 'license': None, 'license_id': None, 'version': 'submittedVersion', 'is_accepted': False, 'is_published': False}, 'type': 'preprint', 'type_crossref': 'posted-content', 'indexed_in': [], '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/A5082781325', 'display_name': 'Alberto Peretti', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Alberto Peretti', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5082781325'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': None, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 62}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.8493, '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.8493, '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/T12292', 'display_name': 'Graph Theory and Algorithms', 'score': 0.825, 'subfield': {'id': 'https://openalex.org/subfields/1707', 'display_name': 'Computer Vision and Pattern Recognition'}, '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/T12176', 'display_name': 'Optimization and Packing Problems', 'score': 0.8188, 'subfield': {'id': 'https://openalex.org/subfields/2209', 'display_name': 'Industrial and Manufacturing Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/minimum-weight', 'display_name': 'Minimum weight', 'score': 0.605776}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.5644699}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.5503287}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.48447752}, {'id': 'https://openalex.org/keywords/degree', 'display_name': 'Degree (music)', 'score': 0.48439723}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.4579872}], 'concepts': [{'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.81572497}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.78214175}, {'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.7283947}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.68966824}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.6841441}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.6747252}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.64358723}, {'id': 'https://openalex.org/C2778945305', 'wikidata': 'https://www.wikidata.org/wiki/Q6865502', 'display_name': 'Minimum weight', 'level': 2, 'score': 0.605776}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.56679845}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.5644699}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.5503287}, {'id': 'https://openalex.org/C51823790', 'wikidata': 'https://www.wikidata.org/wiki/Q504353', 'display_name': 'Greedy algorithm', 'level': 2, 'score': 0.5255153}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.52339345}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.48447752}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.48439723}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.4579872}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.42512178}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.3382656}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.28346866}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.1656208}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.097721934}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C24890656', 'wikidata': 'https://www.wikidata.org/wiki/Q82811', 'display_name': 'Acoustics', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://ideas.repec.org/p/ver/wpaper/08-2018.html', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306401271', 'display_name': 'RePEc: Research Papers in Economics', 'issn_l': None, 'issn': None, 'is_oa': True, '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': ['Federal Reserve Bank of St. Louis'], 'type': 'repository'}, 'license': None, 'license_id': None, 'version': 'submittedVersion', 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3195481350', 'https://openalex.org/W2617647927', 'https://openalex.org/W2505961683', 'https://openalex.org/W2401420742', 'https://openalex.org/W2361573941', 'https://openalex.org/W2361181950', 'https://openalex.org/W2307044859', 'https://openalex.org/W2183510115', 'https://openalex.org/W2095963760', 'https://openalex.org/W2074417667', 'https://openalex.org/W2059559155', 'https://openalex.org/W2017797336', 'https://openalex.org/W1983511657', 'https://openalex.org/W1977567299', 'https://openalex.org/W1965810411', 'https://openalex.org/W1965702747', 'https://openalex.org/W1958279402', 'https://openalex.org/W1923967086', 'https://openalex.org/W1576317141', 'https://openalex.org/W1143194816'], 'abstract_inverted_index': {'In': [0, 29], 'the': [1, 6, 17, 49, 53, 61, 69, 81, 85, 88, 96, 103, 110, 131, 140, 148, 163, 166, 174], 'classical': [2, 175], 'general': [3], 'framework': [4], 'of': [5, 38, 51, 57, 71, 75, 87, 106, 114, 165], 'minimum': [7, 54, 97, 115, 170], 'spanning': [8, 55, 98, 171], 'tree': [9, 56, 99, 172], 'problem': [10, 50, 90, 173], 'for': [11, 84, 146, 154, 162], 'a': [12, 21, 25, 33, 43, 179], 'weighted': [13, 34], 'graph': [14, 35], 'we': [15, 47], 'consider': [16, 48], 'case': [18], 'in': [19, 59], 'which': [20, 60, 147, 155], 'predetermined': [22], 'vertex': [23, 62], 'has': [24, 64, 118], 'certain': [26], 'fixed': [27], 'degree.': [28], 'other': [30, 111], 'words,': [31], 'given': [32], 'G,': [36], 'one': [37, 108, 167], 'its': [39], 'vertices': [40], 'v0': [41, 63], 'and': [42, 123, 152], 'positive': [44], 'integer': [45], 'k,': [46, 66], 'finding': [52], 'G': [58], 'degree': [65, 168], 'that': [67, 79, 117, 161], 'is': [68, 100, 137], 'number': [70], 'edges': [72], 'coming': [73], 'out': [74], 'v0.': [76], 'We': [77, 159], 'recall': [78], 'among': [80], 'various': [82], 'methods': [83], 'solution': [86, 164], 'unconstrained': [89], 'an': [91, 112], 'efficient': [92], 'way': [93], 'to': [94, 130], 'find': [95], 'based': [101], 'on': [102], 'simple': [104], 'procedure': [105], 'choosing': [107], 'after': [109], 'edge': [113], 'weight': [116], 'not': [119, 125], 'be': [120], 'chosen': [121, 133], 'yet': [122], 'does': [124, 157], 'create': [126], 'cycles': [127], 'if': [128], 'added': [129], 'previously': [132], 'edges.': [134], 'This': [135], 'technique': [136], 'known': [138], 'as': [139], '“greedy': [141], 'algorithm”.': [142], 'There': [143], 'are': [144], 'problems': [145, 153], 'greedy': [149, 176], 'algorithm': [150, 177], 'works': [151], 'it': [156], 'not.': [158], 'prove': [160], 'constrained': [169], 'finds': [178], 'right': [180], 'solution.': [181]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W3010374802', 'counts_by_year': [], 'updated_date': '2024-12-12T10:33:40.997325', 'created_date': '2020-03-13'}