{"id":"https://openalex.org/W3201783285","doi":"https://doi.org/10.1145/3472456.3472519","title":"Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems","display_name":"Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems","publication_year":2021,"publication_date":"2021-08-09","ids":{"openalex":"https://openalex.org/W3201783285","doi":"https://doi.org/10.1145/3472456.3472519","mag":"3201783285"},"language":"en","primary_location":{"id":"doi:10.1145/3472456.3472519","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel Processing","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/A5047511868","display_name":"Runtian Ren","orcid":"https://orcid.org/0000-0002-8640-0421"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Runtian Ren","raw_affiliation_strings":["Nanyang Technological University"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015527156","display_name":"Xueyan Tang","orcid":"https://orcid.org/0000-0002-7404-7595"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xueyan Tang","raw_affiliation_strings":["Nanyang Technological University"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047511868"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17095625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9858999848365784,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9825999736785889,"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/interval","display_name":"Interval (graph theory)","score":0.8280022144317627},{"id":"https://openalex.org/keywords/skyline","display_name":"Skyline","score":0.6861760020256042},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5769928693771362},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.554351270198822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5181242823600769},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49241912364959717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47162699699401855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4540586471557617},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4475187659263611},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4135143756866455},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2204437553882599},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08282825350761414},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07938289642333984}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.8280022144317627},{"id":"https://openalex.org/C2780757406","wikidata":"https://www.wikidata.org/wiki/Q465837","display_name":"Skyline","level":2,"score":0.6861760020256042},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5769928693771362},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.554351270198822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181242823600769},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49241912364959717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47162699699401855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4540586471557617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4475187659263611},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4135143756866455},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2204437553882599},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08282825350761414},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07938289642333984},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3472456.3472519","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5437045546","display_name":null,"funder_award_id":"2019-T1-002-042","funder_id":"https://openalex.org/F4320320766","funder_display_name":"Nanyang Technological University"}],"funders":[{"id":"https://openalex.org/F4320320766","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1590696547","https://openalex.org/W1770425921","https://openalex.org/W2011039300","https://openalex.org/W2023661795","https://openalex.org/W2048348088","https://openalex.org/W2089278681","https://openalex.org/W2131641675","https://openalex.org/W2176549387","https://openalex.org/W2469847610","https://openalex.org/W2505550437","https://openalex.org/W2560689012","https://openalex.org/W2624258401","https://openalex.org/W2905987001","https://openalex.org/W2981089183","https://openalex.org/W3036358974","https://openalex.org/W3042299100","https://openalex.org/W3162108930","https://openalex.org/W3174742414","https://openalex.org/W4239855515"],"related_works":["https://openalex.org/W1994126304","https://openalex.org/W2087306197","https://openalex.org/W1973297295","https://openalex.org/W2316530548","https://openalex.org/W2505069962","https://openalex.org/W3096764880","https://openalex.org/W2039842051","https://openalex.org/W2317048282","https://openalex.org/W1580710993","https://openalex.org/W2107409932"],"abstract_inverted_index":{"We":[0,191],"consider":[1],"two":[2,65,138],"combinatorial":[3],"optimization":[4],"problems,":[5],"named":[6],"Generalized":[7],"Skyline":[8],"Interval":[9],"Coloring":[10],"(GSIC)":[11],"and":[12,39,121,202,209],"Dynamic":[13],"Geometric":[14],"Bin":[15],"Packing":[16],"(DGBP).":[17],"The":[18,77,97,158],"input":[19],"to":[20,48,93,100,112,115,148,161],"both":[21,196],"problems":[22,197],"is":[23,47,86,99,111,160,175,182],"a":[24,34,40,51,116,124,173],"set":[25],"of":[26,54,80,118,127,172],"interval":[27,38,53,126],"jobs,":[28],"with":[29,67,140],"each":[30,45,109],"job":[31,46,110,187],"specified":[32,56,129],"by":[33],"horizontal":[35],"active":[36,69,95,142,186],"time":[37,85,171,177],"vertical":[41,52,72,125,153],"size.":[42],"For":[43,63,107,136],"GSIC,":[44],"be":[49,113,122],"allocated":[50,92,123],"the":[55,59,89,94,102,128,132,149,163,169,176,189,199,207],"size":[57,130],"in":[58,131,179,188,198,206],"range":[60,133],"[0,":[61,134],"+\u221e).":[62],"any":[64,84,137],"jobs":[66,139],"overlapping":[68,141],"intervals,":[70,143],"their":[71,152],"intervals":[73,154],"must":[74,155],"not":[75,156],"overlap.":[76,157],"instantaneous":[78],"cost":[79,104],"an":[81],"allocation":[82],"at":[83,183],"defined":[87],"as":[88],"highest":[90],"point":[91],"jobs.":[96],"target":[98,159],"minimize":[101,162],"accumulated":[103],"over":[105],"time.":[106],"DGBP,":[108],"assigned":[114,147],"machine":[117,165,174],"capacity":[119],"g":[120],"g).":[135],"if":[144],"they":[145],"are":[146],"same":[150],"machine,":[151],"total":[164],"busy":[166,170],"time,":[167],"where":[168],"duration":[178],"which":[180],"there":[181],"least":[184],"one":[185],"machine.":[190],"develop":[192],"O(1)-approximation":[193],"algorithms":[194,205],"for":[195],"offline":[200],"setting":[201],"asymptotically":[203],"optimal":[204],"non-clairvoyant":[208],"clairvoyant":[210],"online":[211],"settings.":[212]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}