Publication Information

{'id': 'https://openalex.org/W2062962786', 'doi': 'https://doi.org/10.1145/1290672.1290677', 'title': 'The <i>k</i> -traveling repairmen problem', 'display_name': 'The <i>k</i> -traveling repairmen problem', 'publication_year': 2007, 'publication_date': '2007-11-01', 'ids': {'openalex': 'https://openalex.org/W2062962786', 'doi': 'https://doi.org/10.1145/1290672.1290677', 'mag': '2062962786'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1145/1290672.1290677', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S137348503', 'display_name': 'ACM Transactions on Algorithms', 'issn_l': '1549-6325', 'issn': ['1549-6325', '1549-6333'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319798', 'host_organization_name': 'Association for Computing Machinery', 'host_organization_lineage': ['https://openalex.org/P4310319798'], 'host_organization_lineage_names': ['Association for Computing Machinery'], '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/A5083727723', 'display_name': 'Jittat Fakcharoenphol', 'orcid': 'https://orcid.org/0000-0002-7859-8079'}, 'institutions': [{'id': 'https://openalex.org/I198105771', 'display_name': 'Kasetsart University', 'ror': 'https://ror.org/05gzceg21', 'country_code': 'TH', 'type': 'education', 'lineage': ['https://openalex.org/I198105771']}], 'countries': ['TH'], 'is_corresponding': False, 'raw_author_name': 'Jittat Fakcharoenphol', 'raw_affiliation_strings': ['Kasetsart University'], 'affiliations': [{'raw_affiliation_string': 'Kasetsart University', 'institution_ids': ['https://openalex.org/I198105771']}]}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5041036764', 'display_name': 'Chris Harrelson', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I1291425158', 'display_name': 'Google (United States)', 'ror': 'https://ror.org/00njsd438', 'country_code': 'US', 'type': 'company', 'lineage': ['https://openalex.org/I1291425158', 'https://openalex.org/I4210128969']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Chris Harrelson', 'raw_affiliation_strings': ['Google'], 'affiliations': [{'raw_affiliation_string': 'Google', 'institution_ids': ['https://openalex.org/I1291425158']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5103783564', 'display_name': 'Satish Rao', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I95457486', 'display_name': 'University of California, Berkeley', 'ror': 'https://ror.org/01an7q238', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I95457486']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'Satish Rao', 'raw_affiliation_strings': ['UC Berkeley, Berkeley, CA#TAB#'], 'affiliations': [{'raw_affiliation_string': 'UC Berkeley, Berkeley, CA#TAB#', 'institution_ids': ['https://openalex.org/I95457486']}]}], 'institution_assertions': [], 'countries_distinct_count': 2, 'institutions_distinct_count': 3, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 1.51, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 67, 'citation_normalized_percentile': {'value': 0.952905, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 95, 'max': 96}, 'biblio': {'volume': '3', 'issue': '4', 'first_page': '40', 'last_page': '40'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9999, '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.9999, '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.9968, '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'}}, {'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/steiner-tree-problem', 'display_name': 'Steiner tree problem', 'score': 0.6512574}, {'id': 'https://openalex.org/keywords/hardness-of-approximation', 'display_name': 'Hardness of approximation', 'score': 0.48098958}], 'concepts': [{'id': 'https://openalex.org/C148764684', 'wikidata': 'https://www.wikidata.org/wiki/Q621751', 'display_name': 'Approximation algorithm', 'level': 2, 'score': 0.780555}, {'id': 'https://openalex.org/C76220878', 'wikidata': 'https://www.wikidata.org/wiki/Q1764144', 'display_name': 'Steiner tree problem', 'level': 2, 'score': 0.6512574}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.59859455}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5675214}, {'id': 'https://openalex.org/C177148314', 'wikidata': 'https://www.wikidata.org/wiki/Q170084', 'display_name': 'Generalization', 'level': 2, 'score': 0.5636405}, {'id': 'https://openalex.org/C112955886', 'wikidata': 'https://www.wikidata.org/wiki/Q5656275', 'display_name': 'Hardness of approximation', 'level': 3, 'score': 0.48098958}, {'id': 'https://openalex.org/C2780586882', 'wikidata': 'https://www.wikidata.org/wiki/Q7520643', 'display_name': 'Simple (philosophy)', 'level': 2, 'score': 0.43935594}, {'id': 'https://openalex.org/C176217482', 'wikidata': 'https://www.wikidata.org/wiki/Q860554', 'display_name': 'Metric (unit)', 'level': 2, 'score': 0.41527003}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.4141816}, {'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/C21547014', 'wikidata': 'https://www.wikidata.org/wiki/Q1423657', 'display_name': 'Operations management', '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/C162324750', 'wikidata': 'https://www.wikidata.org/wiki/Q8134', 'display_name': 'Economics', 'level': 0, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1145/1290672.1290677', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S137348503', 'display_name': 'ACM Transactions on Algorithms', 'issn_l': '1549-6325', 'issn': ['1549-6325', '1549-6333'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310319798', 'host_organization_name': 'Association for Computing Machinery', 'host_organization_lineage': ['https://openalex.org/P4310319798'], 'host_organization_lineage_names': ['Association for Computing Machinery'], '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': 19, 'referenced_works': ['https://openalex.org/W1482405521', 'https://openalex.org/W1585272708', 'https://openalex.org/W1601649239', 'https://openalex.org/W1966793805', 'https://openalex.org/W1972755385', 'https://openalex.org/W2002356593', 'https://openalex.org/W2009279347', 'https://openalex.org/W2011595401', 'https://openalex.org/W2044718761', 'https://openalex.org/W2086917808', 'https://openalex.org/W2112638680', 'https://openalex.org/W2115556222', 'https://openalex.org/W2116018028', 'https://openalex.org/W2151148851', 'https://openalex.org/W2168881041', 'https://openalex.org/W2752885492', 'https://openalex.org/W307896644', 'https://openalex.org/W4389615669', 'https://openalex.org/W577294059'], 'related_works': ['https://openalex.org/W328736688', 'https://openalex.org/W3184075718', 'https://openalex.org/W2995411114', 'https://openalex.org/W2367195720', 'https://openalex.org/W2075445622', 'https://openalex.org/W2009976792', 'https://openalex.org/W2004321562', 'https://openalex.org/W1998126097', 'https://openalex.org/W1980288485', 'https://openalex.org/W1968497507'], 'abstract_inverted_index': {'We': [0, 17, 106], 'consider': [1], 'the': [2, 10, 29, 35, 39, 50, 65, 73, 93, 114, 117, 128, 138], 'k': [3, 75], '-traveling': [4], 'repairmen': [5], 'problem,': [6, 13, 52], 'also': [7], 'known': [8], 'as': [9], 'minimum': [11], 'latency': [12], 'to': [14, 91, 137], 'multiple': [15, 141], 'repairmen.': [16], 'give': [18, 123], 'a': [19, 47, 53, 124], 'polynomial-time': [20], '8.497α-approximation': [21], 'algorithm': [22, 68], 'for': [23, 34, 72], 'this': [24], 'generalization,': [25], 'where': [26], 'α': [27], 'denotes': [28], 'best': [30], 'achievable': [31], 'approximation': [32, 67], 'factor': [33, 94], 'problem': [36], 'of': [37, 46, 84, 95, 100, 109, 116, 127, 140, 146], 'finding': [38], 'least-cost': [40], 'rooted': [41], 'tree': [42], 'spanning': [43], 'i': [44], 'vertices': [45], 'metric.': [48], 'For': [49], 'latter': [51], '(2': [54], '+': [55], 'ε)-approximation': [56], 'is': [57, 79], 'known.': [58], 'Our': [59], 'results': [60, 102], 'can': [61, 132], 'be': [62, 133, 145], 'compared': [63], 'with': [64], 'best-known': [66], 'using': [69], 'similar': [70], 'techniques': [71], 'case': [74, 139], '=': [76], '1,': [77], 'which': [78], '3.59α.': [80], 'Moreover,': [81], 'recent': [82], 'work': [83, 112], 'Chaudry': [85], 'et': [86], 'al.': [87], '[2003]': [88], 'shows': [89], 'how': [90], 'remove': [92], 'α,': [96], 'thus': [97], 'improving': [98], 'all': [99], 'these': [101], 'by': [103], 'that': [104, 131], 'factor.': [105], 'are': [107], 'aware': [108], 'no': [110], 'previous': [111], 'on': [113], 'approximability': [115], 'present': [118], 'problem.': [119], 'In': [120], 'addition,': [121], 'we': [122], 'simple': [125], 'proof': [126], '3.59α-approximation': [129], 'result': [130], 'more': [134], 'easily': [135], 'extended': [136], 'repairmen,': [142], 'and': [143], 'may': [144], 'independent': [147], 'interest.': [148]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2062962786', 'counts_by_year': [{'year': 2023, 'cited_by_count': 3}, {'year': 2022, 'cited_by_count': 5}, {'year': 2021, 'cited_by_count': 1}, {'year': 2020, 'cited_by_count': 3}, {'year': 2019, 'cited_by_count': 8}, {'year': 2018, 'cited_by_count': 4}, {'year': 2017, 'cited_by_count': 8}, {'year': 2016, 'cited_by_count': 7}, {'year': 2015, 'cited_by_count': 4}, {'year': 2014, 'cited_by_count': 4}, {'year': 2013, 'cited_by_count': 6}, {'year': 2012, 'cited_by_count': 4}], 'updated_date': '2024-12-13T01:23:59.601897', 'created_date': '2016-06-24'}