Publication Information

{'id': 'https://openalex.org/W2072698009', 'doi': 'https://doi.org/10.5555/313852.314089', 'title': 'Quasi-greedy triangulations approximating the minimum weight triangulation', 'display_name': 'Quasi-greedy triangulations approximating the minimum weight triangulation', 'publication_year': 1996, 'publication_date': '1996-01-28', 'ids': {'openalex': 'https://openalex.org/W2072698009', 'doi': 'https://doi.org/10.5555/313852.314089', 'mag': '2072698009'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1006/jagm.1997.0918', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306420974', 'display_name': 'Symposium on Discrete Algorithms', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-article', '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/A5005407145', 'display_name': 'Christos Levcopoulos', 'orcid': 'https://orcid.org/0000-0003-0983-7862'}, 'institutions': [{'id': 'https://openalex.org/I187531555', 'display_name': 'Lund University', 'ror': 'https://ror.org/012a77v79', 'country_code': 'SE', 'type': 'education', 'lineage': ['https://openalex.org/I187531555']}], 'countries': ['SE'], 'is_corresponding': False, 'raw_author_name': 'Christos Levcopoulos', 'raw_affiliation_strings': ['Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden', 'institution_ids': ['https://openalex.org/I187531555']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5009999441', 'display_name': 'Drago Krznaric', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I187531555', 'display_name': 'Lund University', 'ror': 'https://ror.org/012a77v79', 'country_code': 'SE', 'type': 'education', 'lineage': ['https://openalex.org/I187531555']}], 'countries': ['SE'], 'is_corresponding': False, 'raw_author_name': 'Drago Krznaric', 'raw_affiliation_strings': ['Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden'], 'affiliations': [{'raw_affiliation_string': 'Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden', 'institution_ids': ['https://openalex.org/I187531555']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 5.889, 'has_fulltext': False, 'cited_by_count': 70, 'citation_normalized_percentile': {'value': 0.916216, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 94, 'max': 95}, 'biblio': {'volume': '27', 'issue': '2', 'first_page': '392', 'last_page': '401'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9993, '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': 'Complexity and Algorithms in Graphs', 'score': 0.9993, '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.9989, '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'}}, {'id': 'https://openalex.org/T10374', 'display_name': 'Advanced Graph Theory Research', 'score': 0.9967, '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'}}], 'keywords': [{'id': 'https://openalex.org/keywords/minimum-weight-triangulation', 'display_name': 'Minimum-weight triangulation', 'score': 0.87909937}, {'id': 'https://openalex.org/keywords/minimum-weight', 'display_name': 'Minimum weight', 'score': 0.6481369}, {'id': 'https://openalex.org/keywords/constant', 'display_name': 'Constant (computer programming)', 'score': 0.55613875}, {'id': 'https://openalex.org/keywords/point-set-triangulation', 'display_name': 'Point set triangulation', 'score': 0.5292575}], 'concepts': [{'id': 'https://openalex.org/C39969762', 'wikidata': 'https://www.wikidata.org/wiki/Q6865406', 'display_name': 'Minimum-weight triangulation', 'level': 4, 'score': 0.87909937}, {'id': 'https://openalex.org/C135981907', 'wikidata': 'https://www.wikidata.org/wiki/Q188056', 'display_name': 'Triangulation', 'level': 2, 'score': 0.7775772}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.6673253}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.6649798}, {'id': 'https://openalex.org/C2778945305', 'wikidata': 'https://www.wikidata.org/wiki/Q6865502', 'display_name': 'Minimum weight', 'level': 2, 'score': 0.6481369}, {'id': 'https://openalex.org/C42812', 'wikidata': 'https://www.wikidata.org/wiki/Q1082910', 'display_name': 'Partition (number theory)', 'level': 2, 'score': 0.5606565}, {'id': 'https://openalex.org/C2777027219', 'wikidata': 'https://www.wikidata.org/wiki/Q1284190', 'display_name': 'Constant (computer programming)', 'level': 2, 'score': 0.55613875}, {'id': 'https://openalex.org/C112680207', 'wikidata': 'https://www.wikidata.org/wiki/Q714886', 'display_name': 'Regular polygon', 'level': 2, 'score': 0.55392927}, {'id': 'https://openalex.org/C51823790', 'wikidata': 'https://www.wikidata.org/wiki/Q504353', 'display_name': 'Greedy algorithm', 'level': 2, 'score': 0.5300381}, {'id': 'https://openalex.org/C167117609', 'wikidata': 'https://www.wikidata.org/wiki/Q17078161', 'display_name': 'Point set triangulation', 'level': 3, 'score': 0.5292575}, {'id': 'https://openalex.org/C178609930', 'wikidata': 'https://www.wikidata.org/wiki/Q3538712', 'display_name': 'Pitteway triangulation', 'level': 3, 'score': 0.5242879}, {'id': 'https://openalex.org/C77553402', 'wikidata': 'https://www.wikidata.org/wiki/Q13222579', 'display_name': 'Upper and lower bounds', 'level': 2, 'score': 0.5184902}, {'id': 'https://openalex.org/C68010082', 'wikidata': 'https://www.wikidata.org/wiki/Q192445', 'display_name': 'Delaunay triangulation', 'level': 2, 'score': 0.50869066}, {'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.48244387}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.3956843}, {'id': 'https://openalex.org/C128321387', 'wikidata': 'https://www.wikidata.org/wiki/Q5164356', 'display_name': 'Constrained Delaunay triangulation', 'level': 3, 'score': 0.32205212}, {'id': 'https://openalex.org/C126255220', 'wikidata': 'https://www.wikidata.org/wiki/Q141495', 'display_name': 'Mathematical optimization', 'level': 1, 'score': 0.26522112}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.188871}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.13479793}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', 'level': 1, 'score': 0.10202831}, {'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': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1006/jagm.1997.0918', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306420974', 'display_name': 'Symposium on Discrete Algorithms', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'conference'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [{'id': 'https://metadata.un.org/sdg/10', 'score': 0.44, 'display_name': 'Reduced inequalities'}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 24, 'referenced_works': ['https://openalex.org/W1491725382', 'https://openalex.org/W1507123436', 'https://openalex.org/W1527583442', 'https://openalex.org/W1586795290', 'https://openalex.org/W1608926682', 'https://openalex.org/W1964316024', 'https://openalex.org/W1977014689', 'https://openalex.org/W1983006110', 'https://openalex.org/W1985165973', 'https://openalex.org/W1990313671', 'https://openalex.org/W1994135781', 'https://openalex.org/W2004807868', 'https://openalex.org/W2005314985', 'https://openalex.org/W2010685496', 'https://openalex.org/W2017349122', 'https://openalex.org/W2047330017', 'https://openalex.org/W2053335419', 'https://openalex.org/W2063765938', 'https://openalex.org/W2070754066', 'https://openalex.org/W2075616065', 'https://openalex.org/W2083525325', 'https://openalex.org/W2089506206', 'https://openalex.org/W2157274506', 'https://openalex.org/W40648124'], 'related_works': ['https://openalex.org/W2129174563', 'https://openalex.org/W2116909526', 'https://openalex.org/W2089506206', 'https://openalex.org/W2083525325', 'https://openalex.org/W2075616065', 'https://openalex.org/W2070754066', 'https://openalex.org/W2053335419', 'https://openalex.org/W2047330017', 'https://openalex.org/W2038459618', 'https://openalex.org/W2033521644', 'https://openalex.org/W2015954167', 'https://openalex.org/W2011039300', 'https://openalex.org/W2007610503', 'https://openalex.org/W1994135781', 'https://openalex.org/W1988781483', 'https://openalex.org/W1986347817', 'https://openalex.org/W1983006110', 'https://openalex.org/W1659568777', 'https://openalex.org/W1547668367', 'https://openalex.org/W1491725382'], 'abstract_inverted_index': {'This': [0], 'article': [1], 'settles': [2], 'the': [3, 10, 16, 20, 42, 46, 51, 63, 74, 93, 102], 'following': [4], 'two': [5], 'longstanding': [6], 'open': [7], 'problems:?What': [8], 'is': [9, 36, 49, 55, 60], 'worst': [11], 'case': [12], 'approximation': [13, 91], 'ratio': [14], 'between': [15], 'greedy': [17, 75], 'triangulation': [18, 33], 'and': [19], 'minimum': [21, 94], 'weight': [22, 95], 'triangulation??Is': [23], 'there': [24], 'a': [25, 32, 38, 67, 89], 'polynomial': [26], 'time': [27, 104], 'algorithm': [28, 72], 'that': [29, 50, 88], 'always': [30], 'produces': [31], 'whose': [34], 'length': [35], 'within': [37, 101], 'constant': [39], 'factor': [40], 'from': [41], 'minimum?The': [43], 'answer': [44], 'to': [45], 'first': [47], 'question': [48, 59], 'known': [52], 'lower': [53], 'bound': [54], 'tight.': [56], 'The': [57], 'second': [58], 'answered': [61], 'in': [62], 'affirmative': [64], 'by': [65], 'using': [66], 'slight': [68], 'modification': [69], 'of': [70, 92], 'anO(nlogn)': [71], 'for': [73], 'triangulation.': [76], 'We': [77], 'also': [78], 'derive': [79], 'some': [80], 'other': [81], 'interesting': [82], 'results.': [83], 'For': [84], 'example,': [85], 'we': [86], 'show': [87], 'constant-factor': [90], 'convex': [96], 'partition': [97], 'can': [98], 'be': [99], 'obtained': [100], 'same': [103], 'bounds.': [105]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2072698009', 'counts_by_year': [{'year': 2022, 'cited_by_count': 1}, {'year': 2018, 'cited_by_count': 2}, {'year': 2017, 'cited_by_count': 4}, {'year': 2016, 'cited_by_count': 2}, {'year': 2014, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 3}], 'updated_date': '2024-12-11T04:54:47.911776', 'created_date': '2016-06-24'}