{"id":"https://openalex.org/W2069681889","doi":"https://doi.org/10.1109/iceee.2014.6978272","title":"A fast 4-approximation algorithm for the traveling repairman problem on a line","display_name":"A fast 4-approximation algorithm for the traveling repairman problem on a line","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2069681889","doi":"https://doi.org/10.1109/iceee.2014.6978272","mag":"2069681889"},"language":"en","primary_location":{"id":"doi:10.1109/iceee.2014.6978272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iceee.2014.6978272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012158837","display_name":"S. L. Perez Perez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. L. Perez Perez","raw_affiliation_strings":["Departamento de Tecnolog\u00edas de la Informaci\u00f3n, UAM Cuajimalpa, Mexico City, Mexico","Posgrado en Optimizaci\u00f3n, UAM Azcapotzalco, Mexico City, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Tecnolog\u00edas de la Informaci\u00f3n, UAM Cuajimalpa, Mexico City, Mexico","institution_ids":[]},{"raw_affiliation_string":"Posgrado en Optimizaci\u00f3n, UAM Azcapotzalco, Mexico City, Mexico","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029143568","display_name":"Luis Eduardo Urb\u00e1n Rivero","orcid":"https://orcid.org/0000-0001-8266-4959"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. E. Urban Rivero","raw_affiliation_strings":["Posgrado en Optimizaci\u00f3n, UAM Azcapotzalco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Posgrado en Optimizaci\u00f3n, UAM Azcapotzalco","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112016226","display_name":"Rafael Bracho","orcid":"https://orcid.org/0009-0009-3978-1944"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Lopez Bracho","raw_affiliation_strings":["Departamento de Sistemas, UAM Azcapotzalco, Mexico City, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Sistemas, UAM Azcapotzalco, Mexico City, Mexico","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064414025","display_name":"Francisco Javier Zaragoza Mart\u00ednez","orcid":"https://orcid.org/0000-0001-7570-1483"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. J. Zaragoza Martinez","raw_affiliation_strings":["Departamentu de Sistemas, UAM Azcapotzalco, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamentu de Sistemas, UAM Azcapotzalco, Mexico","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2485,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.83649377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980999827384949,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.6567143797874451},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6055017709732056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5392327308654785},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4960494935512543},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.47706639766693115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4741498827934265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.279252290725708}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6567143797874451},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6055017709732056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5392327308654785},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4960494935512543},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.47706639766693115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4741498827934265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.279252290725708},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iceee.2014.6978272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iceee.2014.6978272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1544163123","https://openalex.org/W1587278640","https://openalex.org/W1995284651","https://openalex.org/W2072592433"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542","https://openalex.org/W4313731559"],"abstract_inverted_index":{"The":[0,43],"traveling":[1],"repairman":[2,11,34],"problem":[3,7],"is":[4,12,35,45,76,83,89],"a":[5,10,28,59,68,101],"scheduling":[6],"in":[8,62,111],"which":[9,32,63],"supposed":[13],"to":[14,21,37,39,46],"visit":[15],"some":[16,23],"customers":[17],"at":[18],"their":[19],"locations":[20,65],"perform":[22,40],"jobs.":[24,42],"Each":[25],"customer":[26],"has":[27],"time":[29,72,80],"window":[30,81],"during":[31],"the":[33,41,48,64,70,79,86,91,107],"allowed":[36],"arrive":[38],"goal":[44],"maximize":[47],"number":[49],"of":[50,73,93],"visited":[51],"locations.":[52],"In":[53],"this":[54,94],"work":[55],"we":[56],"deal":[57],"with":[58],"special":[60,95],"case":[61,96],"are":[66],"on":[67,106],"line,":[69],"processing":[71],"each":[74],"job":[75],"zero,":[77],"and":[78,118],"length":[82],"unitary.":[84],"Although":[85],"general":[87],"TRP":[88],"NP-Hard,":[90],"complexity":[92],"remains":[97],"unknown.":[98],"We":[99],"introduce":[100],"quadratic":[102],"4-approximation":[103],"algorithm":[104,109],"based":[105],"8-approximation":[108],"proposed":[110],"2005":[112],"by":[113],"R.":[114],"Bar-Yehuda,":[115],"G.":[116],"Even,":[117],"S.":[119],"Shahar.":[120]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}