{"id":"https://openalex.org/W2465408074","doi":"https://doi.org/10.4230/lipics.socg.2016.49","title":"On the complexity of minimum-link path problems","display_name":"On the complexity of minimum-link path problems","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2465408074","doi":"https://doi.org/10.4230/lipics.socg.2016.49","mag":"2465408074"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.4230/LIPIcs.SoCG.2016.49","pdf_url":null,"source":{"id":"https://openalex.org/S4306420969","display_name":"Symposium on Computational Geometry","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":[],"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/A5040775926","display_name":"Irina Kostitsyna","orcid":"https://orcid.org/0000-0003-0544-2257"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Irina Kostitsyna","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112453554","display_name":"Maarten L\u00f6ffler","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Maarten L\u00f6ffler","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104000427","display_name":"Valentin Polishchuk","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Valentin Polishchuk","raw_affiliation_strings":["Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032979919","display_name":"Frank Staals","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Frank Staals","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institution_assertions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.993,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.560045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":73,"max":77},"biblio":{"volume":"51","issue":null,"first_page":"16","last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Mesh Generation Algorithms","score":0.9996,"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":"Mesh Generation Algorithms","score":0.9996,"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/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9772,"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/T11522","display_name":"Design and Optimization of Field-Programmable Gate Arrays and Application-Specific Integrated Circuits","score":0.9673,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/link","display_name":"Link (geometry)","score":0.5391898},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication Complexity","score":0.506562}],"concepts":[{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5391898},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.534902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49019152},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38233784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.378342},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36631078},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.4230/LIPIcs.SoCG.2016.49","pdf_url":null,"source":{"id":"https://openalex.org/S4306420969","display_name":"Symposium on Computational Geometry","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.51,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3196321442","https://openalex.org/W3097074791","https://openalex.org/W3095552257","https://openalex.org/W3033574327","https://openalex.org/W3003823299","https://openalex.org/W2990181100","https://openalex.org/W2964242853","https://openalex.org/W2963962070","https://openalex.org/W2952582286","https://openalex.org/W2951329411","https://openalex.org/W2950081279","https://openalex.org/W2949823424","https://openalex.org/W2887688500","https://openalex.org/W2742062324","https://openalex.org/W2401623444","https://openalex.org/W2300360052","https://openalex.org/W2263731576","https://openalex.org/W2054505111","https://openalex.org/W1924557110","https://openalex.org/W1506630368"],"abstract_inverted_index":{"We":[0,27,70,99,144],"revisit":[1],"the":[2,16,31,43,46,73,90,103,142,147,157,183,186,196,209],"minimum-link":[3,104,187],"path":[4,21,188],"problem:":[5],"Given":[6],"a":[7,19,60,66,136,219],"polyhedral":[8],"domain":[9],"and":[10,65,77,84,160,169],"two":[11],"points":[12,17],"in":[13,51,75,81,112,156,190],"it,":[14],"connect":[15],"by":[18,109],"polygonal":[20,120],"with":[22,122],"minimum":[23],"number":[24],"of":[25,45,89,139,185,208],"edges.":[26],"consider":[28],"settings":[29],"where":[30],"min-link":[32],"path's":[33],"vertices":[34],"or":[35,48],"edges":[36],"can":[37,49],"be":[38,50],"restricted":[39],"to":[40,206],"lie":[41],"on":[42,141,201],"boundary":[44],"domain,":[47],"its":[52],"interior.":[53],"Our":[54,192],"results":[55,80,93,193],"include":[56],"bit":[57],"complexity":[58,184],"bounds,":[59],"novel":[61],"general":[62],"hardness":[63],"construction,":[64],"polynomial-time":[67],"approximation":[68],"scheme.":[69],"fully":[71],"characterize":[72],"situation":[74],"2D,":[76],"provide":[78],"first":[79],"dimensions":[82],"3":[83],"higher":[85],"for":[86,118],"several":[87,95],"versions":[88],"problem.\r\n\r\nConcretely,":[91],"our":[92],"resolve":[94,146],"open":[96,129,148],"problems.":[97],"prove":[100],"that":[101,195],"computing":[102],"diffuse":[105],"reflection":[106],"path,":[107],"motivated":[108],"ray":[110],"tracing":[111],"computer":[113],"graphics,":[114],"is":[115,182,198,212],"NP-hard,":[116],"even":[117,200],"two-dimensional":[119],"domains":[121],"holes.":[123],"This":[125],"has":[126],"remained":[127],"an":[128],"problem":[130,149,167,189,197],"[Ghosh":[131],"et":[132,152,175],"al.":[133,153,176],"2012]":[134],"despite":[135],"large":[137],"body":[138],"work":[140],"topic.":[143],"also":[145],"from":[150],"[Mitchell":[151],"1992]":[154],"mentioned":[155],"handbook":[158],"[Goodman":[159],"O'Rourke,":[161],"2004]":[162],"(see":[163,178],"Chapter":[164],"27.5,":[165],"Open":[166,171],"3)":[168],"The":[170],"Problems":[172],"Project":[173],"[Demaine":[174],"TOPP]":[177],"Problem":[179],"22):":[180],"What":[181],"3-space?":[191],"imply":[194],"NP-hard":[199],"terrains":[202],"(and":[203],"hence,":[204],"due":[205],"discreteness":[207],"answer,":[210],"there":[211],"no":[213],"FPTAS":[214],"unless":[215],"P=NP),":[216],"but":[217],"admits":[218],"PTAS.":[220]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2465408074","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2024-10-19T01:19:15.981330","created_date":"2016-07-22"}
