{"id":"https://openalex.org/W2534345173","doi":"https://doi.org/10.1002/net.21742","title":"A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments","display_name":"A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments","publication_year":2017,"publication_date":"2017-04-08","ids":{"openalex":"https://openalex.org/W2534345173","doi":"https://doi.org/10.1002/net.21742","mag":"2534345173"},"language":"en","primary_location":{"id":"doi:10.1002/net.21742","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21742","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1506.05620","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ren\u00e9 van Bevern","orcid":"https://orcid.org/0000-0002-4805-218X"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]},{"id":"https://openalex.org/I4210127387","display_name":"Siberian Branch of the Russian Academy of Sciences","ror":"https://ror.org/02frkq021","country_code":"RU","type":"funder","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Ren\u00e9 van Bevern","raw_affiliation_strings":["Novosibirsk State University Novosibirsk Russian Federation","Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences Novosibirsk Russian Federation"],"raw_orcid":"https://orcid.org/0000-0002-4805-218X","affiliations":[{"raw_affiliation_string":"Novosibirsk State University Novosibirsk Russian Federation","institution_ids":["https://openalex.org/I188973947"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences Novosibirsk Russian Federation","institution_ids":["https://openalex.org/I4210096862","https://openalex.org/I4210127387"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Christian Komusiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Komusiewicz","raw_affiliation_strings":["Institut f\u00fcr Informatik, Friedrich\u2010Schiller\u2010Universit\u00e4t Jena Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Friedrich\u2010Schiller\u2010Universit\u00e4t Jena Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":null,"display_name":"Manuel Sorge","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Manuel Sorge","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik TU Berlin Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik TU Berlin Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188973947","https://openalex.org/I4210096862","https://openalex.org/I4210127387"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.1169,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87825904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"70","issue":"3","first_page":"262","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9319000244140625,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9319000244140625,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012900000438094139,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.006899999920278788,"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/arc-routing","display_name":"Arc routing","score":0.8858000040054321},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.791700005531311},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6086000204086304},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6083999872207642},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5813999772071838},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5777000188827515},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5324000120162964}],"concepts":[{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.8858000040054321},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.791700005531311},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6083999872207642},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5324000120162964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5048999786376953},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48969998955726624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4278999865055084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4124000072479248},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3244999945163727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3050999939441681},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2849999964237213},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.2671000063419342},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.21742","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21742","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1506.05620","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1506.05620","pdf_url":"https://arxiv.org/pdf/1506.05620","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1506.05620","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1506.05620","pdf_url":"https://arxiv.org/pdf/1506.05620","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6528744843","display_name":null,"funder_award_id":"project DAPA (NI 369/12) (to M.S.)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G659201379","display_name":null,"funder_award_id":"project MAGZ (KO 3669/4) (to C.K.)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G903791681","display_name":null,"funder_award_id":"project 16\u201031\u201060007 mol_a_dk (to R. v B.)","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W24573320","https://openalex.org/W74564317","https://openalex.org/W1480355964","https://openalex.org/W1969180675","https://openalex.org/W1969186119","https://openalex.org/W1971353928","https://openalex.org/W1971483538","https://openalex.org/W1974848406","https://openalex.org/W1975085296","https://openalex.org/W1978511881","https://openalex.org/W1980809300","https://openalex.org/W1995988419","https://openalex.org/W2007572995","https://openalex.org/W2008216759","https://openalex.org/W2009550050","https://openalex.org/W2012760542","https://openalex.org/W2035610952","https://openalex.org/W2039011874","https://openalex.org/W2039621427","https://openalex.org/W2044807391","https://openalex.org/W2063292248","https://openalex.org/W2064284095","https://openalex.org/W2070926233","https://openalex.org/W2077422018","https://openalex.org/W2078408696","https://openalex.org/W2080182237","https://openalex.org/W2084507558","https://openalex.org/W2101314043","https://openalex.org/W2116087731","https://openalex.org/W2117395286","https://openalex.org/W2138358085","https://openalex.org/W2138962696","https://openalex.org/W2143987816","https://openalex.org/W2222632097","https://openalex.org/W2482720396","https://openalex.org/W2494101910","https://openalex.org/W2914414140"],"related_works":[],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,67,113],"any":[3],"polynomial\u2010time":[4,18,78],"\u2010approximation":[5,19],"algorithm":[6,20],"for":[7,21,60],"the":[8,22,32,39,43,82,107],"n":[9],"\u2010vertex":[10],"metric":[11],"asymmetric":[12],"Traveling":[13],"Salesperson":[14],"Problem":[15],"yields":[16],"a":[17,120],"mixed":[23],"and":[24,61,95],"windy":[25],"Capacitated":[26],"Arc":[27],"Routing":[28],"Problem,":[29],"where":[30],"is":[31],"number":[33,47],"of":[34],"weakly":[35],"connected":[36],"components":[37,118],"in":[38,48,63,86,100],"subgraph":[40],"induced":[41],"by":[42,119],"positive\u2010demand":[44],"arcs\u2014a":[45],"small":[46],"many":[49,76],"applications.":[50],"In":[51],"conjunction":[52],"with":[53,71],"known":[54],"results,":[55],"we":[56,105],"obtain":[57],"constant\u2010factor":[58],"approximations":[59],"\u2010approximations":[62],"general.":[64],"Experiments":[65],"show":[66],"our":[68],"algorithm,":[69],"together":[70],"several":[72,117],"heuristic":[73],"enhancements,":[74],"outperforms":[75],"previous":[77],"heuristics.":[79],"Finally,":[80],"since":[81,96],"solution":[83],"quality":[84],"achievable":[85],"polynomial":[87],"time":[88],"appears":[89],"to":[90],"mainly":[91],"depend":[92],"on":[93],"C":[94,97],"=":[98],"1":[99],"almost":[101],"all":[102],"benchmark":[103,109],"instances,":[104],"propose":[106],"Ob":[108],"set,":[110],"simulating":[111],"cities":[112],"are":[114],"divided":[115],"into":[116],"river.":[121],"\u00a9":[122],"2017":[123,131],"Wiley":[124],"Periodicals,":[125],"Inc.":[126],"NETWORKS,":[127],"Vol.":[128],"70(3),":[129],"262\u2013278":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-10-28T00:00:00"}