{"id":"https://openalex.org/W2100264647","doi":"https://doi.org/10.1142/s0218195993000269","title":"AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES","display_name":"AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2100264647","doi":"https://doi.org/10.1142/s0218195993000269","mag":"2100264647"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000269","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5075781836","display_name":"Teofilo F. Gonzalez","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"TEOFILO F. GONZALEZ","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, California 93106\u20135110, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, California 93106\u20135110, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061567307","display_name":"Mohammadreza Razzazi","orcid":"https://orcid.org/0000-0002-3936-6355"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MOHAMMADREZA RAZZAZI","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, California 93106\u20135110, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, California 93106\u20135110, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111392484","display_name":"Si-Qing Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SI-QING ZHENG","raw_affiliation_strings":["Computer Science Department, Louisiana State University, Baton Rouge, Louisiana 70803\u20134020, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Louisiana State University, Baton Rouge, Louisiana 70803\u20134020, USA","institution_ids":["https://openalex.org/I121820613"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.239,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.723179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":74,"max":75},"biblio":{"volume":"03","issue":"04","first_page":"417","last_page":"428"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Connected Component Labeling Algorithms","score":0.9993,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12923","display_name":"Connected Component Labeling Algorithms","score":0.9993,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Mesh Generation Algorithms","score":0.9993,"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/T12176","display_name":"Optimization of Cutting and Packing Problems","score":0.9951,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"Approximation Algorithms","score":0.581467},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.5804579},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.53611106},{"id":"https://openalex.org/keywords/three-dimensional-packing","display_name":"Three-Dimensional Packing","score":0.516414},{"id":"https://openalex.org/keywords/geometric-optimization","display_name":"Geometric Optimization","score":0.50665},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.41877443}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.75527},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7407665},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.732686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.71368074},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6773273},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.5804579},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.53611106},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.41877443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.406601},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37867516},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1130051}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000269","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4376167435","https://openalex.org/W4247094814","https://openalex.org/W2468848027","https://openalex.org/W2369655046","https://openalex.org/W2242098268","https://openalex.org/W2097569240","https://openalex.org/W2090254384","https://openalex.org/W2019467317","https://openalex.org/W1965515989","https://openalex.org/W1585519779"],"abstract_inverted_index":{"Let":[0],"P":[1,55],"be":[2,88],"a":[3,10,27,48,99],"set":[4,28],"of":[5,20,29,35,43],"n":[6],"points":[7,53],"located":[8],"inside":[9],"d-box":[11],"(rectangle":[12],"if":[13,32,40],"d=2)":[14,33],"R.":[15],"We":[16,96],"study":[17],"the":[18,44,92,107,113],"problem":[19,61,100],"partitioning":[21],"R":[22],"into":[23],"d-boxes":[24,46],"by":[25,81],"introducing":[26],"hyperplane":[30],"(line":[31],"segments":[34],"least":[36],"total":[37],"(d-1)\u2013volume":[38],"(length":[39],"d=2).":[41],"Each":[42],"resulting":[45],"in":[47],"valid":[49],"partition":[50,79],"cannot":[51],"contain":[52],"from":[54],"as":[56],"interior":[57],"points.":[58],"Since":[59],"this":[60],"is":[62,85,110,121],"computationally":[63],"intractable":[64],"(NP-hard)":[65],"even":[66],"when":[67],"d=2,":[68],"we":[69],"present":[70,98],"an":[71],"efficient":[72],"approximation":[73,83,108],"algorithm":[74,84,120],"for":[75,102,105,112,118],"its":[76],"solution.":[77],"The":[78,115],"generated":[80],"our":[82,119],"guaranteed":[86],"to":[87],"within":[89],"2d":[90],"times":[91],"optimal":[93],"solution":[94],"value.":[95],"also":[97],"instance":[101],"each":[103],"d\u22652":[104],"which":[106],"bound":[109],"tight":[111],"algorithm.":[114],"time":[116],"complexity":[117],"O(dn":[122],"log":[123],"n).":[124]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2100264647","counts_by_year":[],"updated_date":"2024-10-19T21:06:53.745709","created_date":"2016-06-24"}
