{"id":"https://openalex.org/W4281676033","doi":"https://doi.org/10.1145/3519935.3520049","title":"Bypassing the surface embedding: approximation schemes for network design in minor-free graphs","display_name":"Bypassing the surface embedding: approximation schemes for network design in minor-free graphs","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281676033","doi":"https://doi.org/10.1145/3519935.3520049"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520049","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","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/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Research, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":["https://openalex.org/I4210100430"],"apc_list":null,"apc_paid":null,"fwci":0.6787,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75442391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8377223014831543},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.630933403968811},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.61433345079422},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5999274253845215},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.5880717635154724},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.532731831073761},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.49951171875},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4928269684314728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47792941331863403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46758365631103516},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.43259352445602417},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.414087176322937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40241390466690063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37596309185028076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3382037281990051},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25462809205055237},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.1661440134048462},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.16348806023597717},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12717071175575256},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10555252432823181},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09128797054290771}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8377223014831543},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.630933403968811},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.61433345079422},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5999274253845215},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.5880717635154724},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.532731831073761},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.49951171875},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4928269684314728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47792941331863403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46758365631103516},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.43259352445602417},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.414087176322937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40241390466690063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37596309185028076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3382037281990051},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25462809205055237},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1661440134048462},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.16348806023597717},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12717071175575256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10555252432823181},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09128797054290771},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520049","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1518503263","https://openalex.org/W1560551754","https://openalex.org/W1607394607","https://openalex.org/W1993862500","https://openalex.org/W1994248285","https://openalex.org/W2009693817","https://openalex.org/W2018419361","https://openalex.org/W2035409201","https://openalex.org/W2042899161","https://openalex.org/W2053578961","https://openalex.org/W2062254875","https://openalex.org/W2072312786","https://openalex.org/W2078191188","https://openalex.org/W2083210138","https://openalex.org/W2096304547","https://openalex.org/W2130481157","https://openalex.org/W2131648596","https://openalex.org/W2141355868","https://openalex.org/W2142607374","https://openalex.org/W2150410057","https://openalex.org/W2151148851","https://openalex.org/W2155735286","https://openalex.org/W2204163060","https://openalex.org/W2570206580","https://openalex.org/W2714858040","https://openalex.org/W2890355536","https://openalex.org/W2900306427","https://openalex.org/W2942945545","https://openalex.org/W2943587448","https://openalex.org/W2944960889","https://openalex.org/W2953292887","https://openalex.org/W2963821675","https://openalex.org/W2971849881","https://openalex.org/W2997716981","https://openalex.org/W3001243123","https://openalex.org/W3127920245","https://openalex.org/W3167350281","https://openalex.org/W4232911940","https://openalex.org/W4281669183"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"Since":[0],"the":[1,4,7,16,21,27,53,62],"mid":[2],"90s,":[3],"study":[5],"of":[6,9,49,52,55],"complexity":[8],"classic":[10],"network":[11],"design":[12],"problems":[13],"such":[14,33],"as":[15,34],"traveling":[17],"salesman":[18],"problem":[19,24,29],"(TSP),":[20],"Steiner":[22],"tree":[23],"(ST),":[25],"or":[26,41],"k-MST":[28],"on":[30],"metric":[31,59],"spaces":[32],"low-dimensional":[35],"Euclidean":[36],"spaces,":[37,60],"doubling":[38],"metrics,":[39],"planar":[40],"minor-free":[42],"graphs,":[43],"has":[44],"led":[45],"to":[46],"major":[47],"improvements":[48],"our":[50],"understanding":[51],"structure":[54],"both":[56],"these":[57],"important":[58],"and":[61],"underlying":[63],"problems.":[64]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}