Publication Information

{'id': 'https://openalex.org/W2010585027', 'doi': 'https://doi.org/10.1109/iccct.2010.5640455', 'title': 'An approximate algorithm for degree constraint minimum spanning tree', 'display_name': 'An approximate algorithm for degree constraint minimum spanning tree', 'publication_year': 2010, 'publication_date': '2010-09-01', 'ids': {'openalex': 'https://openalex.org/W2010585027', 'doi': 'https://doi.org/10.1109/iccct.2010.5640455', 'mag': '2010585027'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/iccct.2010.5640455', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-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/A5048992115', 'display_name': 'Sweetesh Singh', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I152869788', 'display_name': 'Motilal Nehru National Institute of Technology', 'ror': 'https://ror.org/04dp7tp96', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I152869788']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Sweetesh Singh', 'raw_affiliation_strings': ['Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India', 'institution_ids': ['https://openalex.org/I152869788']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5103161860', 'display_name': 'Rupesh Kumar Srivastava', 'orcid': 'https://orcid.org/0000-0002-4032-4267'}, 'institutions': [{'id': 'https://openalex.org/I152869788', 'display_name': 'Motilal Nehru National Institute of Technology', 'ror': 'https://ror.org/04dp7tp96', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I152869788']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Rupesh Srivastava', 'raw_affiliation_strings': ['Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India', 'institution_ids': ['https://openalex.org/I152869788']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5101831327', 'display_name': 'Varun Ravi Kumar', 'orcid': 'https://orcid.org/0000-0002-8596-7629'}, 'institutions': [{'id': 'https://openalex.org/I152869788', 'display_name': 'Motilal Nehru National Institute of Technology', 'ror': 'https://ror.org/04dp7tp96', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I152869788']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Varun Kumar', 'raw_affiliation_strings': ['Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India', 'institution_ids': ['https://openalex.org/I152869788']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5102079330', 'display_name': 'Suneeta Agarwal', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I152869788', 'display_name': 'Motilal Nehru National Institute of Technology', 'ror': 'https://ror.org/04dp7tp96', 'country_code': 'IN', 'type': 'education', 'lineage': ['https://openalex.org/I152869788']}], 'countries': ['IN'], 'is_corresponding': False, 'raw_author_name': 'Suneeta Agarwal', 'raw_affiliation_strings': ['Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science & Engineering, Motilal Nehru National Institute of Technology, Allahabad, India', 'institution_ids': ['https://openalex.org/I152869788']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.735, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 7, 'citation_normalized_percentile': {'value': 0.779304, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 82, 'max': 83}, 'biblio': {'volume': None, 'issue': None, 'first_page': '687', 'last_page': '692'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10847', 'display_name': 'Advanced Optical Network Technologies', 'score': 0.9966, 'subfield': {'id': 'https://openalex.org/subfields/2208', 'display_name': 'Electrical and Electronic Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, 'topics': [{'id': 'https://openalex.org/T10847', 'display_name': 'Advanced Optical Network Technologies', 'score': 0.9966, 'subfield': {'id': 'https://openalex.org/subfields/2208', 'display_name': 'Electrical and Electronic Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.9919, '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/T10996', 'display_name': 'Computational Geometry and Mesh Generation', 'score': 0.9913, 'subfield': {'id': 'https://openalex.org/subfields/1704', 'display_name': 'Computer Graphics and Computer-Aided Design'}, '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/degree', 'display_name': 'Degree (music)', 'score': 0.69883627}, {'id': 'https://openalex.org/keywords/reverse-delete-algorithm', 'display_name': 'Reverse-delete algorithm', 'score': 0.62138927}, {'id': 'https://openalex.org/keywords/prims-algorithm', 'display_name': "Prim's algorithm", 'score': 0.61095047}, {'id': 'https://openalex.org/keywords/k-minimum-spanning-tree', 'display_name': 'k-minimum spanning tree', 'score': 0.6105591}, {'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5411832}, {'id': 'https://openalex.org/keywords/steiner-tree-problem', 'display_name': 'Steiner tree problem', 'score': 0.46578613}, {'id': 'https://openalex.org/keywords/constraint-graph', 'display_name': 'Constraint graph', 'score': 0.4543887}, {'id': 'https://openalex.org/keywords/gomory–hu-tree', 'display_name': 'Gomory–Hu tree', 'score': 0.43611094}], 'concepts': [{'id': 'https://openalex.org/C65949645', 'wikidata': 'https://www.wikidata.org/wiki/Q5283163', 'display_name': 'Distributed minimum spanning tree', 'level': 3, 'score': 0.858817}, {'id': 'https://openalex.org/C13743678', 'wikidata': 'https://www.wikidata.org/wiki/Q240464', 'display_name': 'Minimum spanning tree', 'level': 2, 'score': 0.84197795}, {'id': 'https://openalex.org/C64331007', 'wikidata': 'https://www.wikidata.org/wiki/Q831672', 'display_name': 'Spanning tree', 'level': 2, 'score': 0.7923138}, {'id': 'https://openalex.org/C2775997480', 'wikidata': 'https://www.wikidata.org/wiki/Q586277', 'display_name': 'Degree (music)', 'level': 2, 'score': 0.69883627}, {'id': 'https://openalex.org/C199346575', 'wikidata': 'https://www.wikidata.org/wiki/Q4925151', 'display_name': 'Reverse-delete algorithm', 'level': 4, 'score': 0.62138927}, {'id': 'https://openalex.org/C1649724', 'wikidata': 'https://www.wikidata.org/wiki/Q470813', 'display_name': "Prim's algorithm", 'level': 4, 'score': 0.61095047}, {'id': 'https://openalex.org/C202750272', 'wikidata': 'https://www.wikidata.org/wiki/Q6322849', 'display_name': 'k-minimum spanning tree', 'level': 5, 'score': 0.6105591}, {'id': 'https://openalex.org/C145685049', 'wikidata': 'https://www.wikidata.org/wiki/Q4454941', 'display_name': 'Euclidean minimum spanning tree', 'level': 4, 'score': 0.5923539}, {'id': 'https://openalex.org/C63645285', 'wikidata': 'https://www.wikidata.org/wiki/Q797860', 'display_name': "Kruskal's algorithm", 'level': 3, 'score': 0.5595831}, {'id': 'https://openalex.org/C2776036281', 'wikidata': 'https://www.wikidata.org/wiki/Q48769818', 'display_name': 'Constraint (computer-aided design)', 'level': 2, 'score': 0.54504925}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5411832}, {'id': 'https://openalex.org/C64271015', 'wikidata': 'https://www.wikidata.org/wiki/Q6865444', 'display_name': 'Minimum degree spanning tree', 'level': 3, 'score': 0.4919686}, {'id': 'https://openalex.org/C23394520', 'wikidata': 'https://www.wikidata.org/wiki/Q4919350', 'display_name': 'Shortest-path tree', 'level': 3, 'score': 0.49136868}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.48435625}, {'id': 'https://openalex.org/C76220878', 'wikidata': 'https://www.wikidata.org/wiki/Q1764144', 'display_name': 'Steiner tree problem', 'level': 2, 'score': 0.46578613}, {'id': 'https://openalex.org/C62611344', 'wikidata': 'https://www.wikidata.org/wiki/Q1062658', 'display_name': 'Node (physics)', 'level': 2, 'score': 0.456057}, {'id': 'https://openalex.org/C178481205', 'wikidata': 'https://www.wikidata.org/wiki/Q5164372', 'display_name': 'Constraint graph', 'level': 5, 'score': 0.4543887}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.45390925}, {'id': 'https://openalex.org/C147517495', 'wikidata': 'https://www.wikidata.org/wiki/Q5581241', 'display_name': 'Gomory–Hu tree', 'level': 5, 'score': 0.43611094}, {'id': 'https://openalex.org/C162307627', 'wikidata': 'https://www.wikidata.org/wiki/Q204833', 'display_name': 'Enhanced Data Rates for GSM Evolution', 'level': 2, 'score': 0.42308113}, {'id': 'https://openalex.org/C100560664', 'wikidata': 'https://www.wikidata.org/wiki/Q3608019', 'display_name': 'K-ary tree', 'level': 4, 'score': 0.4227534}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.4139213}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.34056017}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.281921}, {'id': 'https://openalex.org/C163797641', 'wikidata': 'https://www.wikidata.org/wiki/Q2067937', 'display_name': 'Tree structure', 'level': 3, 'score': 0.24402031}, {'id': 'https://openalex.org/C173404611', 'wikidata': 'https://www.wikidata.org/wiki/Q528588', 'display_name': 'Constraint programming', 'level': 3, 'score': 0.1998778}, {'id': 'https://openalex.org/C197855036', 'wikidata': 'https://www.wikidata.org/wiki/Q380172', 'display_name': 'Binary tree', 'level': 2, 'score': 0.11764631}, {'id': 'https://openalex.org/C176783269', 'wikidata': 'https://www.wikidata.org/wiki/Q5164378', 'display_name': 'Constraint logic programming', 'level': 4, 'score': 0.11457986}, {'id': 'https://openalex.org/C66938386', 'wikidata': 'https://www.wikidata.org/wiki/Q633538', 'display_name': 'Structural engineering', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C24890656', 'wikidata': 'https://www.wikidata.org/wiki/Q82811', 'display_name': 'Acoustics', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C127413603', 'wikidata': 'https://www.wikidata.org/wiki/Q11023', 'display_name': 'Engineering', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C137631369', 'wikidata': 'https://www.wikidata.org/wiki/Q7617831', 'display_name': 'Stochastic programming', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C121332964', 'wikidata': 'https://www.wikidata.org/wiki/Q413', 'display_name': 'Physics', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C76155785', 'wikidata': 'https://www.wikidata.org/wiki/Q418', 'display_name': 'Telecommunications', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/iccct.2010.5640455', 'pdf_url': None, 'source': None, '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': 13, 'referenced_works': ['https://openalex.org/W1520068163', 'https://openalex.org/W1948148225', 'https://openalex.org/W1965680834', 'https://openalex.org/W1995670816', 'https://openalex.org/W2011039300', 'https://openalex.org/W2014340938', 'https://openalex.org/W2017927472', 'https://openalex.org/W2110786500', 'https://openalex.org/W2151610140', 'https://openalex.org/W2161880126', 'https://openalex.org/W2417562192', 'https://openalex.org/W4255306344', 'https://openalex.org/W4285719527'], 'related_works': ['https://openalex.org/W3081212354', 'https://openalex.org/W2943635264', 'https://openalex.org/W2384589661', 'https://openalex.org/W2361573941', 'https://openalex.org/W2353822696', 'https://openalex.org/W2281826919', 'https://openalex.org/W2130375301', 'https://openalex.org/W2010585027', 'https://openalex.org/W1973100174', 'https://openalex.org/W1587959445'], 'abstract_inverted_index': {'DCMST': [0], '(Degree': [1], 'Constraint': [2], 'Minimum': [3], 'Spanning': [4], 'Tree)': [5], 'is': [6, 16, 40, 43, 62, 73], 'a': [7, 20, 24, 60, 92], 'special': [8], 'case': [9], 'of': [10, 23, 59, 64], 'minimum': [11], 'spanning': [12, 21, 93], 'tree': [13, 22, 94, 105], 'problem': [14, 46, 75], 'which': [15, 85], 'concerned': [17], 'with': [18, 106], 'finding': [19], 'nonnegative': [25], 'edge': [26, 38], 'weighted': [27], 'graph': [28], 'such': [29], 'that': [30, 69], 'all': [31], 'nodes': [32], 'satisfy': [33], 'degree': [34, 58, 96], 'restrictions': [35], 'and': [36, 50, 90, 98], 'total': [37], 'length': [39], 'minimum.': [41], 'It': [42], 'an': [44, 82], 'important': [45], 'in': [47, 53, 77, 87], 'operation': [48], 'research': [49], 'finds': [51], 'application': [52], 'communication': [54], 'network': [55], 'design': [56, 81], 'where': [57], 'node': [61], 'indicator': [63], 'input-output': [65], 'ports': [66], 'available': [67], 'on': [68], 'terminal.': [70], 'As': [71], 'it': [72], 'NP-complete': [74], 'so': [76], 'this': [78], 'paper': [79], 'we': [80], 'approximate': [83], 'algorithm': [84], 'works': [86], 'three': [88], 'stages': [89], 'determines': [91], 'satisfying': [95], 'constraint': [97], 'also': [99], 'guarantees': [100], 'to': [101, 108], 'give': [102], 'nearly': [103], 'optimal': [104], 'respect': [107], 'cost.': [109]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2010585027', 'counts_by_year': [{'year': 2023, 'cited_by_count': 1}, {'year': 2021, 'cited_by_count': 1}, {'year': 2020, 'cited_by_count': 1}, {'year': 2017, 'cited_by_count': 1}, {'year': 2014, 'cited_by_count': 1}, {'year': 2013, 'cited_by_count': 2}], 'updated_date': '2024-12-29T14:14:16.706543', 'created_date': '2016-06-24'}