{"id":"https://openalex.org/W1978064083","doi":"https://doi.org/10.1145/1798596.1798609","title":"Approximating corridors and tours via restriction and relaxation techniques","display_name":"Approximating corridors and tours via restriction and relaxation techniques","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1978064083","doi":"https://doi.org/10.1145/1798596.1798609","mag":"1978064083"},"language":"en","primary_location":{"id":"doi:10.1145/1798596.1798609","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1798596.1798609","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5036423230","display_name":"Arturo Gonz\u00e1lez-Guti\u00e9rrez","orcid":"https://orcid.org/0000-0001-6170-8967"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arturo Gonzalez-Gutierrez","raw_affiliation_strings":["University of California, Santa Barbara, CA","University of California, Santa Barbara, Ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara, Ca#TAB#","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075781836","display_name":"Teofilo F. Gonzalez","orcid":"https://orcid.org/0009-0009-8211-4135"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Teofilo F. Gonzalez","raw_affiliation_strings":["University of California, Santa Barbara, CA","University of California, Santa Barbara, Ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara, Ca#TAB#","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.6668,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66649421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9977999925613403,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9966999888420105,"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/mathematics","display_name":"Mathematics","score":0.7309148907661438},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.7108237743377686},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.7083069682121277},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6807841062545776},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6484291553497314},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.6085431575775146},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.582029402256012},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5109333395957947},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4778311252593994},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.47333982586860657},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4397313892841339},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42192792892456055},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42107194662094116},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.40305736660957336},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.26817113161087036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12792158126831055}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7309148907661438},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.7108237743377686},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7083069682121277},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6807841062545776},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6484291553497314},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6085431575775146},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.582029402256012},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5109333395957947},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4778311252593994},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.47333982586860657},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4397313892841339},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42192792892456055},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42107194662094116},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.40305736660957336},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.26817113161087036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12792158126831055},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1798596.1798609","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1798596.1798609","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.393.9728","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.9728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~teo/papers/CorrApp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.926.3381","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.926.3381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Teofilo_Gonzalez/publication/220390427_Approximating_corridors_and_tours_via_restriction_and_relaxation_techniques/links/0a85e5356eae71fe39000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W114413251","https://openalex.org/W1541239238","https://openalex.org/W1555471913","https://openalex.org/W1559701472","https://openalex.org/W1591968161","https://openalex.org/W1829285201","https://openalex.org/W1975442866","https://openalex.org/W1986201860","https://openalex.org/W2038002703","https://openalex.org/W2107739573","https://openalex.org/W2112643218","https://openalex.org/W2127728226","https://openalex.org/W2141791003","https://openalex.org/W2164756925","https://openalex.org/W2165541052","https://openalex.org/W2401610261","https://openalex.org/W2917188837"],"related_works":["https://openalex.org/W3022023143","https://openalex.org/W2942906518","https://openalex.org/W2074099701","https://openalex.org/W4288363470","https://openalex.org/W2755482478","https://openalex.org/W2118379976","https://openalex.org/W4242769409","https://openalex.org/W1978064083","https://openalex.org/W2593390198","https://openalex.org/W1999091136"],"abstract_inverted_index":{"Given":[0],"a":[1,15,24,97,117,137],"rectangular":[2,42,66,138],"boundary":[3,43,46,59,139],"partitioned":[4,140],"into":[5,141],"rectangles,":[6,49],"the":[7,36,41,45,48,58,65,78,86,100,104,122,130,147,156],"Minimum-Length":[8],"Corridor":[9],"(MLC-R)":[10],"problem":[11,70,95,102],"consists":[12],"of":[13,17,26,31,47,60,99],"finding":[14],"corridor":[16,22],"least":[18,54],"total":[19],"length.":[20],"A":[21],"is":[23,71,96,116],"set":[25],"connected":[27],"line":[28,37],"segments,":[29],"each":[30],"which":[32],"must":[33,51],"lie":[34],"along":[35],"segments":[38],"that":[39],"form":[40],"and/or":[44],"and":[50,63,88,114,158],"include":[52],"at":[53],"one":[55],"point":[56],"from":[57,64],"every":[61],"rectangle":[62],"boundary.":[67],"The":[68,92],"MLC-R":[69,87,101],"known":[72],"to":[73],"be":[74],"NP-hard.":[75],"We":[76,119],"present":[77,121],"first":[79,123],"polynomial-time":[80,124],"constant":[81,125],"ratio":[82,126],"approximation":[83,127,160],"algorithm":[84,128],"for":[85,110,129,136],"MLC":[89,93,148],"k":[90,94,113,115,149],"problems.":[91],"generalization":[98],"where":[103],"rectangles":[105],"are":[106,153],"rectilinear":[107,142],"c":[108,111,143],"-gons,":[109],"\u2264":[112],"constant.":[118],"also":[120],"Group":[131],"Traveling":[132],"Salesperson":[133],"Problem":[134],"(GTSP)":[135],"-gons":[144],"as":[145],"in":[146],"problem.":[150],"Our":[151],"algorithms":[152],"based":[154],"on":[155],"restriction":[157],"relaxation":[159],"techniques.":[161]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}