Publication Information

{'id': 'https://openalex.org/W2146489710', 'doi': 'https://doi.org/10.1137/s0097539797328847', 'title': 'Gadgets, Approximation, and Linear Programming', 'display_name': 'Gadgets, Approximation, and Linear Programming', 'publication_year': 2000, 'publication_date': '2000-01-01', 'ids': {'openalex': 'https://openalex.org/W2146489710', 'doi': 'https://doi.org/10.1137/s0097539797328847', 'mag': '2146489710'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1137/s0097539797328847', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S153560523', 'display_name': 'SIAM Journal on Computing', 'issn_l': '0097-5397', 'issn': ['0097-5397', '1095-7111'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320508', 'host_organization_name': 'Society for Industrial and Applied Mathematics', 'host_organization_lineage': ['https://openalex.org/P4310320508'], 'host_organization_lineage_names': ['Society for Industrial and Applied Mathematics'], '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/A5057752375', 'display_name': 'Luca Trevisan', 'orcid': 'https://orcid.org/0000-0002-6982-8530'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Luca Trevisan', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5083890565', 'display_name': 'Gregory B. Sorkin', 'orcid': 'https://orcid.org/0000-0003-4935-7820'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Gregory B. Sorkin', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5101519422', 'display_name': 'Madhu Sudan', 'orcid': 'https://orcid.org/0000-0003-3718-6489'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Madhu Sudan', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5043667154', 'display_name': 'David P. Williamson', 'orcid': 'https://orcid.org/0000-0002-2884-0058'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'David P. Williamson', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 9.432, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 211, 'citation_normalized_percentile': {'value': 0.999807, 'is_in_top_1_percent': True, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 98, 'max': 99}, 'biblio': {'volume': '29', 'issue': '6', 'first_page': '2074', 'last_page': '2097'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', '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': 'Complexity and Algorithms in Graphs', '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': 'Advanced Graph Theory Research', 'score': 0.9984, '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': 'Optimization and Search Problems', 'score': 0.9946, '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/duality', 'display_name': 'Duality (order theory)', 'score': 0.44691828}, {'id': 'https://openalex.org/keywords/maximum-cut', 'display_name': 'Maximum cut', 'score': 0.43519065}], 'concepts': [{'id': 'https://openalex.org/C41045048', 'wikidata': 'https://www.wikidata.org/wiki/Q202843', 'display_name': 'Linear programming', 'level': 2, 'score': 0.54241735}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.54189396}, {'id': 'https://openalex.org/C2780586882', 'wikidata': 'https://www.wikidata.org/wiki/Q7520643', 'display_name': 'Simple (philosophy)', 'level': 2, 'score': 0.50324863}, {'id': 'https://openalex.org/C2778572836', 'wikidata': 'https://www.wikidata.org/wiki/Q380933', 'display_name': 'Space (punctuation)', 'level': 2, 'score': 0.4882503}, {'id': 'https://openalex.org/C108710211', 'wikidata': 'https://www.wikidata.org/wiki/Q11538', 'display_name': 'Mathematical proof', 'level': 2, 'score': 0.47036812}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.46597764}, {'id': 'https://openalex.org/C2778023678', 'wikidata': 'https://www.wikidata.org/wiki/Q554403', 'display_name': 'Duality (order theory)', 'level': 2, 'score': 0.44691828}, {'id': 'https://openalex.org/C165526019', 'wikidata': 'https://www.wikidata.org/wiki/Q942557', 'display_name': 'Maximum cut', 'level': 3, 'score': 0.43519065}, {'id': 'https://openalex.org/C77553402', 'wikidata': 'https://www.wikidata.org/wiki/Q13222579', 'display_name': 'Upper and lower bounds', 'level': 2, 'score': 0.42046666}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.41360852}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.40751854}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.24129328}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C134306372', 'wikidata': 'https://www.wikidata.org/wiki/Q7754', 'display_name': 'Mathematical analysis', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C138885662', 'wikidata': 'https://www.wikidata.org/wiki/Q5891', 'display_name': 'Philosophy', '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/C111472728', 'wikidata': 'https://www.wikidata.org/wiki/Q9471', 'display_name': 'Epistemology', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C111919701', 'wikidata': 'https://www.wikidata.org/wiki/Q9135', 'display_name': 'Operating system', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1137/s0097539797328847', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S153560523', 'display_name': 'SIAM Journal on Computing', 'issn_l': '0097-5397', 'issn': ['0097-5397', '1095-7111'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320508', 'host_organization_name': 'Society for Industrial and Applied Mathematics', 'host_organization_lineage': ['https://openalex.org/P4310320508'], 'host_organization_lineage_names': ['Society for Industrial and Applied Mathematics'], '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': 17, 'referenced_works': ['https://openalex.org/W1492679536', 'https://openalex.org/W1967935161', 'https://openalex.org/W1985123706', 'https://openalex.org/W1995016490', 'https://openalex.org/W2001564241', 'https://openalex.org/W2004660767', 'https://openalex.org/W2030087828', 'https://openalex.org/W2038225707', 'https://openalex.org/W2051605160', 'https://openalex.org/W2087226760', 'https://openalex.org/W2109039359', 'https://openalex.org/W2111385661', 'https://openalex.org/W2125347105', 'https://openalex.org/W2137373403', 'https://openalex.org/W2148352980', 'https://openalex.org/W2159579504', 'https://openalex.org/W2401610261'], 'related_works': ['https://openalex.org/W4387820098', 'https://openalex.org/W4236324517', 'https://openalex.org/W3196207352', 'https://openalex.org/W3084261076', 'https://openalex.org/W2963408011', 'https://openalex.org/W2951724202', 'https://openalex.org/W2808944898', 'https://openalex.org/W2576399385', 'https://openalex.org/W1996614773', 'https://openalex.org/W1991078291'], 'abstract_inverted_index': {'We': [0, 199], 'present': [1, 46], 'a': [2, 29, 38, 47, 61], 'linear': [3, 84], 'programming-based': [4], 'method': [5, 27, 44, 58], 'for': [6, 53, 119, 143, 156, 210], 'finding': [7], '"gadgets,"': [8], 'i.e.,': [9], 'combinatorial': [10], 'structures': [11], 'reducing': [12], 'constraints': [13, 19], 'of': [14, 20, 49, 76, 82, 98, 102, 109, 133, 218, 249, 256, 263], 'one': [15], 'optimization': [16], 'problem': [17], 'to': [18, 37, 78, 130, 149, 204], 'another.': [21], 'A': [22], 'key': [23], 'step': [24], 'in': [25], 'this': [26, 42, 150, 181], 'is': [28, 141, 197], 'simple': [30], 'observation': [31], 'which': [32, 213], 'limits': [33], 'the': [34, 80, 103, 115, 152, 178, 183, 202, 223, 250], 'search': [35], 'space': [36], 'finite': [39], 'one.': [40], 'Using': [41], 'new': [43, 91], 'we': [45], 'number': [48], 'new,': [50], 'computer-constructed': [51], 'gadgets': [52, 179, 203], 'several': [54], 'different': [55], 'reductions.': [56], 'This': [57, 220], 'also': [59, 200], 'answers': [60], 'question': [62], 'posed': [63], 'by': [64], 'Bellare,': [65, 162, 191], 'Goldreich,': [66, 164, 192], 'and': [67, 122, 137, 165, 193, 195, 232, 244, 258], 'Sudan': [68, 167, 194], '[SIAM': [69], 'J.': [70, 170], 'Comput.,': [71, 171], '27': [72, 172], '(1998),': [73, 173], 'pp.': [74, 112, 174, 240, 261], '804--915]': [75], 'how': [77], 'prove': [79], 'optimality': [81], 'gadgets:': [83], 'programming': [85], 'duality': [86], 'gives': [87], 'such': [88], 'proofs.': [89], 'The': [90], 'gadgets,': [92], 'when': [93], 'combined': [94], 'with': [95], 'recent': [96], 'results': [97, 118], 'Håstad': [99, 196], '[': [100, 168], 'Proceedings': [101], '29th': [104], 'ACM': [105], 'Symposium': [106, 253], 'on': [107, 254], 'Theory': [108, 255], 'Computing,': [110], '1997,': [111], '1--10],': [113], 'improve': [114], 'known': [116], 'inapproximability': [117, 154], 'MAX': [120, 123], 'CUT': [121], 'DICUT,': [124], 'showing': [125], 'that': [126, 187], 'approximating': [127], 'these': [128], 'problems': [129, 158], 'within': [131], 'factors': [132], '$16/17': [134], '+': [135], 'ε$': [136], '$12/13+': [138], 'ε,$': [139], 'respectively,': [140], 'NP-hard': [142], 'every': [144], 'ε': [145], '>': [146], '0.': [147], 'Prior': [148], 'work,': [151], 'best-known': [153], 'thresholds': [155], 'both': [157], 'were': [159], '71/72': [160], '(M.': [161], 'O.': [163], 'M.': [166, 229, 245], 'SIAM': [169], '804--915]).': [175], 'Without': [176], 'using': [177], 'from': [180, 190, 228], 'paper,': [182], 'best': [184, 225], 'possible': [185], 'hardness': [186], 'would': [188], 'follow': [189], '18/19.': [198], 'use': [201], 'obtain': [205], 'an': [206, 215], 'improved': [207], 'approximation': [208, 216], 'algorithm': [209], 'MAX3': [211], 'SAT': [212], 'guarantees': [214], 'ratio': [217], '.801.': [219], 'improves': [221], 'upon': [222], 'previous': [224], 'bound': [226], '(implicit': [227], 'X.': [230, 246], 'Goemans': [231, 247], 'D.': [233], 'P.': [234], 'Williamson': [235], '[J.': [236], 'ACM,': [237], '42': [238], '(1995),': [239], '1115--1145];': [241], 'U.': [242], 'Feige': [243], '[Proceedings': [248], 'Third': [251], 'Israel': [252], 'Computing': [257], 'Systems,': [259], '1995,': [260], '182--189])': [262], '.7704.': [264]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2146489710', 'counts_by_year': [{'year': 2024, 'cited_by_count': 6}, {'year': 2023, 'cited_by_count': 2}, {'year': 2022, 'cited_by_count': 6}, {'year': 2021, 'cited_by_count': 6}, {'year': 2020, 'cited_by_count': 4}, {'year': 2019, 'cited_by_count': 6}, {'year': 2018, 'cited_by_count': 3}, {'year': 2017, 'cited_by_count': 9}, {'year': 2016, 'cited_by_count': 13}, {'year': 2015, 'cited_by_count': 9}, {'year': 2014, 'cited_by_count': 23}, {'year': 2013, 'cited_by_count': 12}, {'year': 2012, 'cited_by_count': 13}], 'updated_date': '2024-12-13T13:42:44.329016', 'created_date': '2016-06-24'}