{"id":"https://openalex.org/W1975625792","doi":"https://doi.org/10.5555/365411.365533","title":"Better approximation algorithms for bin covering","display_name":"Better approximation algorithms for bin covering","alternate_titles":[],"publication_year":2001,"publication_date":"2001-01-09","ids":{"openalex":"https://openalex.org/W1975625792","doi":"https://doi.org/10.5555/365411.365533","mag":"1975625792"},"language":"en","primary_location":{"id":"mag:1975625792","doi":"https://doi.org/10.5555/365411.365533","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda2001.html#CsirikJK01","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1975625792"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5065289106","display_name":"J\u00e1nos Csirik","orcid":"https://orcid.org/0000-0003-3870-0363","observed_orcids":["https://orcid.org/0000-0003-3870-0363"]},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"J\u00e1nos Csirik","raw_affiliation_strings":["Department of Computer Sciences, University of Szeged, Szeged, Hungary#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Szeged, Szeged, Hungary#TAB#","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"David S. Johnson","raw_affiliation_strings":["AT&T Labs, Room C239, 180 Park Avenue, Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, Room C239, 180 Park Avenue, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035864448","display_name":"Claire Mathieu","orcid":"https://orcid.org/0000-0002-0517-112X","observed_orcids":["https://orcid.org/0000-0002-0517-112X"]},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Claire Kenyon","raw_affiliation_strings":["Laboratoire de Recherche en Informatique, B\u00e2timent 490, Universit\u00e9 Paris Sud, 91405 Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique, B\u00e2timent 490, Universit\u00e9 Paris Sud, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8714,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.90991957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"557","last_page":"566"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9897000193595886,"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.9897000193595886,"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/T12288","display_name":"Optimization and Search Problems","score":0.006000000052154064,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0017999999690800905,"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/approximation-algorithms","display_name":"approximation algorithms","score":0.9509999752044678},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"bin packing","score":0.8600000143051147},{"id":"https://openalex.org/keywords/approximation-methods","display_name":"approximation methods","score":0.6010000109672546},{"id":"https://openalex.org/keywords/e-learning","display_name":"online learning","score":0.30399999022483826},{"id":"https://openalex.org/keywords/worst-case-analysis","display_name":"worst-case analysis","score":0.597000002861023},{"id":"https://openalex.org/keywords/average-case-analysis","display_name":"average-case analysis","score":0.6980000138282776}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.884013295173645},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7105021476745605},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6973668336868286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6328485012054443},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6278613805770874},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6010013818740845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5896953344345093},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.553123414516449},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43095168471336365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.422435998916626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2912176251411438},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"mag:1975625792","doi":"https://doi.org/10.5555/365411.365533","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda2001.html#CsirikJK01","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.6511","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/2001/Csirik-2001-BAA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.6437","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.6437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~dsj/papers/BCsoda.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.5536","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.5536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://algo.inria.fr/Alcophys/Papers/CsJoKe00.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1504056704","https://openalex.org/W1517988587","https://openalex.org/W1994442196","https://openalex.org/W2053134800","https://openalex.org/W2057764247","https://openalex.org/W2059942530","https://openalex.org/W2086436817","https://openalex.org/W2088080491","https://openalex.org/W2125081783","https://openalex.org/W2172277188","https://openalex.org/W2962924833"],"related_works":["https://openalex.org/W2024624524","https://openalex.org/W178499933","https://openalex.org/W90213227","https://openalex.org/W2053393096","https://openalex.org/W7100999901","https://openalex.org/W1965153006","https://openalex.org/W1992365301","https://openalex.org/W1482409676","https://openalex.org/W6979793547","https://openalex.org/W2006671706"],"abstract_inverted_index":{"Bin":[0],"covering":[1],"takes":[2],"as":[3,19,54,56],"input":[4],"a":[5,33,35,121],"list":[6],"of":[7,15,24,59,77,136],"item":[8],"sizes":[9],"and":[10,79,119,138],"places":[11],"them":[12],"into":[13],"bins":[14,25],"unit":[16],"demand":[17,27],"so":[18],"to":[20,38,153],"maximize":[21],"the":[22,39,52,57,60,72,85,90,143],"number":[23],"whose":[26,99,151],"is":[28,31,102],"satisfied.":[29],"This":[30],"in":[32,75],"sense":[34],"dual":[36],"problem":[37,69],"classical":[40],"one-dimensional":[41],"bin":[42,149],"packing":[43],"problem,":[44],"but":[45],"has":[46,125],"for":[47,67,89,105,111,130,148],"many":[48],"years":[49],"lagged":[50],"behind":[51],"latter":[53],"far":[55],"quality":[58],"best":[61],"approximation":[62,87],"algorithms.":[63],"We":[64,82],"design":[65],"algorithms":[66,94,135],"this":[68],"that":[70,124],"close":[71],"gap,":[73],"both":[74],"terms":[76],"worst-":[78],"averagecase":[80],"results.":[81],"present":[83],"(1)":[84],"first":[86],"scheme":[88],"offline":[91],"version,":[92],"(2)":[93,137],"with":[95],"bounded":[96],"worst-case":[97],"behavior":[98,101,129],"expected":[100,117,128],"asymptotically":[103,126],"optimal":[104,113,127],"all":[106,131],"discrete":[107,132],"\"perfect-packing":[108],"distributions\"":[109],"(ones":[110],"which":[112],"packings":[114],"have":[115],"sublinear":[116],"waste),":[118],"(3)":[120,139],"learning":[122],"algorithm":[123,147],"distributions.":[133],"The":[134],"are":[140],"based":[141],"on":[142],"recently-developed":[144],"online":[145],"Sum-of-Squares":[146],"packing,":[150],"adaptation":[152],"the...":[154]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1975625792","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
