{"id":"https://openalex.org/W2105692312","doi":"https://doi.org/10.1007/bfb0054353","title":"An approximation scheme for bin packing with conflicts","display_name":"An approximation scheme for bin packing with conflicts","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2105692312","doi":"https://doi.org/10.1007/bfb0054353","mag":"2105692312"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0054353","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054353","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["IDSIA, Lugano, Switzerland","IDSIA#TAB#"],"affiliations":[{"raw_affiliation_string":"IDSIA, Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279"]},{"raw_affiliation_string":"IDSIA#TAB#","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I2614128279"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3092,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91773779,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937999844551086,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9926999807357788,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8220876455307007},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7377169132232666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5943965315818787},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5488281846046448},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5196408033370972},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4854157865047455},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.47741544246673584},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4720797538757324},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.456709086894989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4460406005382538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44169771671295166},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.41595956683158875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.407748818397522},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.399812787771225},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3521580696105957},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3141455054283142},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22371873259544373},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06676667928695679}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8220876455307007},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7377169132232666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5943965315818787},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5488281846046448},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5196408033370972},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4854157865047455},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.47741544246673584},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4720797538757324},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.456709086894989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4460406005382538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44169771671295166},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.41595956683158875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.407748818397522},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.399812787771225},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3521580696105957},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3141455054283142},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22371873259544373},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06676667928695679},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0054353","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054353","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.4438","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/kj/SWAT98_L.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.9592","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.hpc.uh.edu/pub/ipco98/jansen.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W38717466","https://openalex.org/W1519941054","https://openalex.org/W1521219120","https://openalex.org/W1522546256","https://openalex.org/W1543921836","https://openalex.org/W2006379203","https://openalex.org/W2011039300","https://openalex.org/W2019977411","https://openalex.org/W2023149711","https://openalex.org/W2032876227","https://openalex.org/W2057674319","https://openalex.org/W2088776663","https://openalex.org/W2098362962","https://openalex.org/W2117158270","https://openalex.org/W2123068254","https://openalex.org/W2143474538","https://openalex.org/W2145028977","https://openalex.org/W4285719527","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W2175868772","https://openalex.org/W2173431370","https://openalex.org/W1587078595","https://openalex.org/W2143410025","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W3123083091"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}