{"id":"https://openalex.org/W2089927779","doi":"https://doi.org/10.1142/s1793830914500116","title":"THE MINIMUM GUARDING TREE PROBLEM","display_name":"THE MINIMUM GUARDING TREE PROBLEM","publication_year":2013,"publication_date":"2013-10-30","ids":{"openalex":"https://openalex.org/W2089927779","doi":"https://doi.org/10.1142/s1793830914500116","mag":"2089927779"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830914500116","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830914500116","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5091313409","display_name":"Adrian Dumitrescu","orcid":"https://orcid.org/0000-0002-1118-0321"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ADRIAN DUMITRESCU","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, WI 53211, USA","Department of Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53211, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, WI 53211, USA","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53211, USA","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[{"id":"https://openalex.org/I1327163397","display_name":"State University of New York","ror":"https://ror.org/01q1z8k08","country_code":"US","type":"education","lineage":["https://openalex.org/I1327163397"]},{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOSEPH S. B. MITCHELL","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, NY 11794-3600, USA"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, NY 11794-3600, USA","institution_ids":["https://openalex.org/I1327163397","https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038614609","display_name":"Pawe\u0142 \u017byli\u0144ski","orcid":"https://orcid.org/0000-0001-6378-7742"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"PAWEL \u017bYLI\u0143SKI","raw_affiliation_strings":["Institute of Informatics, University of Gda\u0144sk, 80-952 Gda\u0144sk, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Gda\u0144sk, 80-952 Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091313409"],"corresponding_institution_ids":["https://openalex.org/I43579087"],"apc_list":null,"apc_paid":null,"fwci":0.6751,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7876576,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"06","issue":"01","first_page":"1450011","last_page":"1450011"},"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.9995999932289124,"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.9995999932289124,"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.9955000281333923,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.992900013923645,"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/combinatorics","display_name":"Combinatorics","score":0.7131905555725098},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.6114152669906616},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.5906044244766235},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5904621481895447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5838585495948792},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4887971580028534},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4844355881214142},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.45781320333480835},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.45388633012771606},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42295193672180176},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41720446944236755},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33813026547431946},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3004370331764221},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2901054918766022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2573999762535095},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0895797610282898}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7131905555725098},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.6114152669906616},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.5906044244766235},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5904621481895447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5838585495948792},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4887971580028534},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4844355881214142},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.45781320333480835},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.45388633012771606},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42295193672180176},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41720446944236755},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33813026547431946},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3004370331764221},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2901054918766022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2573999762535095},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0895797610282898},{"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":[{"id":"doi:10.1142/s1793830914500116","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830914500116","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W194727567","https://openalex.org/W1519914687","https://openalex.org/W1521628414","https://openalex.org/W1532095960","https://openalex.org/W1559701472","https://openalex.org/W1591968161","https://openalex.org/W1973307935","https://openalex.org/W1978064083","https://openalex.org/W2020112047","https://openalex.org/W2038002703","https://openalex.org/W2038393491","https://openalex.org/W2046450589","https://openalex.org/W2063312439","https://openalex.org/W2064086982","https://openalex.org/W2067096513","https://openalex.org/W2082141764","https://openalex.org/W2084452856","https://openalex.org/W2094658339","https://openalex.org/W2095509593","https://openalex.org/W2107739573","https://openalex.org/W2131962075","https://openalex.org/W2251414797","https://openalex.org/W2502636724","https://openalex.org/W2610052675","https://openalex.org/W2952337504","https://openalex.org/W2986240932","https://openalex.org/W3030774092","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W2592730620","https://openalex.org/W1850638833","https://openalex.org/W2567686633","https://openalex.org/W2090953203","https://openalex.org/W1535035810","https://openalex.org/W3143022568","https://openalex.org/W1570285387","https://openalex.org/W2145020325","https://openalex.org/W2396761877","https://openalex.org/W2906572927"],"abstract_inverted_index":{"Given":[0],"a":[1,11,17,23,37,59,70,78,89,100,110,133,140,164,169,172],"set":[2,91,141,173],"\u2112":[3,33],"of":[4,29,45,63,92,117,128,131,136,142,171,174],"non-parallel":[5,177],"lines":[6,31,49,93,178,204],"in":[7,26,32,50,66,147,179,205],"the":[8,27,30,43,46,55,67,105,129,148,180],"plane":[9,68],"and":[10,69,159,189],"nonempty":[12,71],"subset":[13,72,170],"\u2112\u2032":[14,21,51],"\u2286":[15,74],"\u2112,":[16],"guarding":[18,79,85,102,120,134,166],"tree":[19,24,80,86,103,135,167],"for":[20,81,88,104,139,162,168,203],"is":[22,97,201],"contained":[25],"union":[28],"such":[34],"that":[35,198],"if":[36],"mobile":[38],"guard":[39],"(agent)":[40],"runs":[41],"on":[42],"edges":[44],"tree,":[47],"all":[48],"are":[52,185],"visited":[53],"by":[54],"guard.":[56],"Similarly,":[57],"given":[58,90],"connected":[60],"arrangement":[61],"\ud835\udcae":[62],"line":[64,95,145],"segments":[65,96,146],"\ud835\udcae\u2032":[73],"\ud835\udcae,":[75],"we":[76,151,196],"define":[77],"\ud835\udcae\u2032.":[82],"The":[83],"minimum":[84,118,137,165],"problem":[87,130,200],"or":[94],"to":[98],"find":[99],"minimum-length":[101],"input":[106],"set.":[107],"We":[108],"provide":[109],"simple":[111],"alternative":[112],"(to":[113],"[N.":[114],"Xu,":[115],"Complexity":[116],"corridor":[119],"problems,":[121],"Inf.":[122],"Process.":[123],"Lett.112(17\u201318)":[124],"(2012)":[125],"691\u2013696.])":[126],"proof":[127],"finding":[132],"length":[138],"orthogonal":[143],"(axis-parallel)":[144],"plane.":[149],"Then,":[150],"present":[152],"two":[153],"approximation":[154],"algorithms":[155],"with":[156],"factors":[157],"2":[158],"3.98,":[160],"respectively,":[161],"computing":[163],"n":[175],"arbitrary":[176],"plane;":[181],"their":[182],"running":[183],"times":[184],"O(n":[186,190],"8":[187],")":[188],"6":[191],"log":[192],"n),":[193],"respectively.":[194],"Finally,":[195],"show":[197],"this":[199],"NP-hard":[202],"3-space.":[206]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}