{"id":"https://openalex.org/W2889438244","doi":"https://doi.org/10.4230/lipics.esa.2018.8","title":"Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension","display_name":"Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2889438244","doi":"https://doi.org/10.4230/lipics.esa.2018.8","mag":"2889438244"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007485091","display_name":"Amariah Becker","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Becker, Amariah","raw_affiliation_strings":["Department of Computer Science, Brown University","Brown University, Providence, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University","institution_ids":["https://openalex.org/I175594653"]},{"raw_affiliation_string":"Brown University, Providence, United States","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Klein, Philip N.","raw_affiliation_strings":["Department of Computer Science, Brown University","Brown University, Providence, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University","institution_ids":["https://openalex.org/I175594653"]},{"raw_affiliation_string":"Brown University, Providence, United States","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005657476","display_name":"David Saulpic","orcid":"https://orcid.org/0000-0003-4208-8541"},"institutions":[{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]}],"countries":["BI"],"is_corresponding":false,"raw_author_name":"Saulpic, David","raw_affiliation_strings":["D\u00e9partement d'Informatique, \u00c9cole Normale Sup\u00e9rieure"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'Informatique, \u00c9cole Normale Sup\u00e9rieure","institution_ids":["https://openalex.org/I4210103330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.36,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8956614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"15","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9925000071525574,"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.9925000071525574,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/bounded-function","display_name":"Bounded function","score":0.8320857286453247},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6271962523460388},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5576853156089783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5415956377983093},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4859503507614136},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4852306842803955},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4696480631828308},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.45213478803634644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33616161346435547},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31479698419570923},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14949840307235718},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10829561948776245}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8320857286453247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6271962523460388},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5576853156089783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5415956377983093},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4859503507614136},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4852306842803955},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4696480631828308},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.45213478803634644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33616161346435547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31479698419570923},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14949840307235718},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10829561948776245},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:9471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1707.08270","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1707.08270","pdf_url":"https://arxiv.org/pdf/1707.08270","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":"","raw_type":"text"},{"id":"doi:10.4230/lipics.esa.2018.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2018.8","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:2889438244","is_oa":false,"landing_page_url":"http://drops.dagstuhl.de/opus/volltexte/2018/9471/pdf/LIPIcs-ESA-2018-8.pdf/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6800000071525574}],"awards":[{"id":"https://openalex.org/G8131322490","display_name":"AF: Medium: Collaborative Research: Fast and accurate optimization in planar graphs and beyond","funder_award_id":"1409520","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2559541197","https://openalex.org/W2155735286","https://openalex.org/W2759676378","https://openalex.org/W3012882765","https://openalex.org/W2165142526","https://openalex.org/W2151148851","https://openalex.org/W2111563176","https://openalex.org/W2963431883","https://openalex.org/W2962682232","https://openalex.org/W2965002304","https://openalex.org/W2966058519","https://openalex.org/W2568219823","https://openalex.org/W2104166288","https://openalex.org/W2053578961","https://openalex.org/W2055569927","https://openalex.org/W2017372614","https://openalex.org/W1977541023","https://openalex.org/W2294941918","https://openalex.org/W3041909641","https://openalex.org/W2952569022"],"abstract_inverted_index":{"The":[0,168],"concept":[1],"of":[2,12,20,35,52,74,89,102,121,145,185,214,229,243],"bounded":[3,21,36,75,186,230],"highway":[4,22,76,187,231],"dimension":[5,23],"was":[6],"developed":[7],"to":[8,48,129,140,166,195,239,245],"capture":[9],"observed":[10],"properties":[11],"road":[13],"networks.":[14],"We":[15,60,135],"show":[16,61],"that":[17,42,62,199,207],"a":[18,25,33,40,66,84,87,93,100,142,151,179,223],"graph":[19,34],"with":[24,92],"distinguished":[26],"root":[27,146],"vertex":[28,209],"can":[29,126,161],"be":[30,127],"embedded":[31],"into":[32],"treewidth":[37],"in":[38,72,183,227],"such":[39,206],"way":[41],"u-to-v":[43],"distance":[44,212],"is":[45,99,108,178,194,210,222,238],"preserved":[46],"up":[47],"an":[49],"additive":[50],"error":[51],"epsilon":[53],"times":[54],"the":[55,81,97,159,192,236,241,246],"u-to-root":[56],"plus":[57],"v-to-root":[58],"distances.":[59],"this":[63,79,137,190,234],"embedding":[64,138,169],"yields":[65],"PTAS":[67,125,152,180,224],"for":[68,132,153,174,181,218,225],"Bounded-Capacity":[69,156],"Vehicle":[70,157],"Routing":[71],"graphs":[73,184,228],"dimension.":[77,188,232],"In":[78,189,233],"problem,":[80,191,235],"input":[82],"specifies":[83],"depot":[85,165],"and":[86,95,113],"set":[88,101,143],"clients,":[90],"each":[91,106,114],"location":[94],"demand;":[96],"output":[98],"depot-to-depot":[103],"tours,":[104],"where":[105],"client":[107,122],"visited":[109],"by":[110],"some":[111,215],"tour":[112,115],"covers":[116],"at":[117],"most":[118],"Q":[119],"units":[120],"demand.":[123],"Our":[124],"extended":[128],"handle":[130,141],"penalties":[131],"unvisited":[133],"clients.":[134],"extend":[136],"result":[139,149,170],"S":[144],"vertices.":[147],"This":[148],"implies":[150,172],"Multiple":[154],"Depot":[155],"Routing:":[158],"tours":[160],"go":[162],"from":[163],"one":[164],"another.":[167],"also":[171],"that,":[173],"fixed":[175,219],"k,":[176,220],"there":[177,200,221],"k-Center":[182],"goal":[193,237],"minimize":[196,240],"d":[197,213],"so":[198],"exist":[201],"k":[202,247],"vertices":[203],"(the":[204],"centers)":[205],"every":[208],"within":[211],"center.":[216],"Similarly,":[217],"k-Median":[226],"sum":[242],"distances":[244],"centers.":[248]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2018-09-07T00:00:00"}