{"id":"https://openalex.org/W4318045175","doi":"https://doi.org/10.1142/s0129054122460054","title":"Improved Approximation Algorithms for Bin Packing with Conflicts","display_name":"Improved Approximation Algorithms for Bin Packing with Conflicts","publication_year":2023,"publication_date":"2023-01-25","ids":{"openalex":"https://openalex.org/W4318045175","doi":"https://doi.org/10.1142/s0129054122460054"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054122460054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122460054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5100750044","display_name":"Zhihua Huang","orcid":"https://orcid.org/0000-0003-0880-1622"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihua Huang","raw_affiliation_strings":["Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100601642","display_name":"An Zhang","orcid":"https://orcid.org/0000-0002-6085-9402"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"An Zhang","raw_affiliation_strings":["Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069718437","display_name":"Gy\u00f6rgy D\u00f3sa","orcid":"https://orcid.org/0000-0002-4909-6694"},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gy\u00f6rgy D\u00f3sa","raw_affiliation_strings":["Pannon University, Egyetem str. 10., Veszpr\u00e9m H-8200, Hungary"],"affiliations":[{"raw_affiliation_string":"Pannon University, Egyetem str. 10., Veszpr\u00e9m H-8200, Hungary","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100454424","display_name":"Yong Chen","orcid":"https://orcid.org/0000-0002-8377-5914"},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong Chen","raw_affiliation_strings":["Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081819179","display_name":"Chenling Xiong","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenling Xiong","raw_affiliation_strings":["Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100601642"],"corresponding_institution_ids":["https://openalex.org/I50760025"],"apc_list":null,"apc_paid":null,"fwci":0.6017,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71761087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"36","issue":"05","first_page":"667","last_page":"682"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983000159263611,"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.9983000159263611,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9783999919891357,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9758999943733215,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8082360625267029},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7194278836250305},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6735769510269165},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.64560467004776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6297279000282288},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6203712224960327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6195576190948486},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6156167387962341},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6108511686325073},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5579537153244019},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5113958716392517},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47372427582740784},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.44637641310691833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36068981885910034},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35161542892456055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2745169997215271}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8082360625267029},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7194278836250305},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6735769510269165},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.64560467004776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6297279000282288},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6203712224960327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6195576190948486},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6156167387962341},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6108511686325073},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5579537153244019},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5113958716392517},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47372427582740784},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.44637641310691833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36068981885910034},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35161542892456055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2745169997215271},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/s0129054122460054","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122460054","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4863128177","display_name":null,"funder_award_id":"11771114","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7850758615","display_name":null,"funder_award_id":"11971139","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W179790402","https://openalex.org/W589946094","https://openalex.org/W1554729673","https://openalex.org/W1847958188","https://openalex.org/W2000840218","https://openalex.org/W2002284890","https://openalex.org/W2005124115","https://openalex.org/W2024997287","https://openalex.org/W2048947076","https://openalex.org/W2052059627","https://openalex.org/W2084224084","https://openalex.org/W2088776663","https://openalex.org/W2124475618","https://openalex.org/W2343846702","https://openalex.org/W2610183793","https://openalex.org/W3198883588"],"related_works":["https://openalex.org/W2741543745","https://openalex.org/W1599205373","https://openalex.org/W2587433615","https://openalex.org/W1779359754","https://openalex.org/W1988771411","https://openalex.org/W2050319410","https://openalex.org/W4285771333","https://openalex.org/W3014730867","https://openalex.org/W2044180942","https://openalex.org/W4318045175"],"abstract_inverted_index":{"Given":[0],"a":[1,6,23,28,52],"set":[2,44],"of":[3,16,25,31,39,54],"items,":[4],"and":[5,59,81,95],"conflict":[7],"graph":[8],"defined":[9],"on":[10,70],"the":[11,14,36,48,68,102],"item":[12],"set,":[13],"problem":[15,69],"bin":[17,49,57],"packing":[18,58],"with":[19],"conflicts":[20],"asks":[21],"for":[22,78],"partition":[24],"items":[26,40],"into":[27],"minimum":[29],"number":[30],"independent":[32,43],"sets":[33],"so":[34],"that":[35],"total":[37],"size":[38],"in":[41],"each":[42],"does":[45],"not":[46],"exceed":[47],"capacity.":[50],"As":[51],"generalization":[53],"both":[55,100],"classic":[56,60],"vertex":[61],"coloring,":[62],"it":[63],"is":[64],"hard":[65],"to":[66,90],"approximate":[67],"general":[71],"graphs.":[72,83],"We":[73],"present":[74],"new":[75],"approximation":[76,86],"algorithms":[77],"bipartite":[79],"graphs":[80],"split":[82],"The":[84],"absolute":[85],"ratios":[87],"are":[88],"shown":[89],"be":[91],"[Formula:":[92,96],"see":[93,97],"text]":[94,98],"respectively,":[99],"improving":[101],"existing":[103],"results.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}