{"id":"https://openalex.org/W2963801096","doi":"https://doi.org/10.4230/oasics.sosa.2018.8","title":"A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version","display_name":"A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2963801096","doi":"https://doi.org/10.4230/oasics.sosa.2018.8","mag":"2963801096"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://arxiv.org/abs/1708.01657","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","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/A5109583026","display_name":"Allan Borodin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Allan Borodin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102878447","display_name":"Denis Pankratov","orcid":"https://orcid.org/0000-0002-6183-8363"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis Pankratov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058217217","display_name":"Amirali Salehi\u2010Abari","orcid":"https://orcid.org/0000-0001-8053-7710"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amirali Salehi-Abari","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.483,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.682825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":74,"max":77},"biblio":{"volume":"61","issue":null,"first_page":"12","last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.988,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.88078946},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.8347269},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5453209}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.88078946},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.8347269},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6383209},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5465011},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5453209},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.52431786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48677942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4642288},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42658076},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3873422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.374473},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34733623},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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":[{"is_oa":false,"landing_page_url":"https://arxiv.org/abs/1708.01657","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.42,"display_name":"Peace, justice, and strong institutions"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2998509247","https://openalex.org/W2982303827","https://openalex.org/W2963083784","https://openalex.org/W2945519246","https://openalex.org/W2890423536","https://openalex.org/W2794235031","https://openalex.org/W279205284","https://openalex.org/W2755845379","https://openalex.org/W2618972974","https://openalex.org/W2481908560","https://openalex.org/W2213753232","https://openalex.org/W2188725153","https://openalex.org/W2080561834","https://openalex.org/W2066284144","https://openalex.org/W2053900376","https://openalex.org/W2048947076","https://openalex.org/W2042512761","https://openalex.org/W1997598240","https://openalex.org/W1519618847"],"abstract_inverted_index":{"Recently,":[0],"Renault":[1,42],"(2016)":[2],"studied":[3],"the":[4,10,30,45,53,68,93,114,159,165,193,214,221,240,244,262,268,271,275],"dual":[5,31,49,94,115,194,263],"bin":[6,32,50,95,116,195,264],"packing":[7,33,51,96,117,196,265],"problem":[8,34,126,224,266],"in":[9,52,171,274],"per-request":[11],"advice":[12,22,46,87,215,235,276],"model":[13,55],"of":[14,40,48,56,72,200,270],"online":[15,35,57,82,210],"algorithms.":[16,58,258],"He":[17],"showed":[18],"that":[19,84,176,212,238],"given":[20],"O(1/eps)":[21],"bits":[23,199],"for":[24,113,122,182],"each":[25],"input":[26,74],"item":[27,75],"allows":[28],"approximating":[29],"to":[36,97,130,144,157,192,226,243],"within":[37,98],"a":[38,79,99,109,120,123,149,189],"factor":[39],"1+\\eps.":[41],"asked":[43],"about":[44],"complexity":[47,216,236,277],"tape-advice":[54],"We":[59,77,174,231],"make":[60],"progress":[61],"on":[62,167,261],"this":[63,103,204],"question.":[64],"Let":[65],"s":[66,168,178],"be":[67],"maximum":[69],"bit":[70],"size":[71],"an":[73,209],"weight.":[76],"present":[78],"conceptually":[80],"simple":[81,110],"algorithm":[83],"with":[85],"total":[86],"O((s":[88],"+":[89],"log":[90],"n)/eps^2)":[91],"approximates":[92],"1+eps":[100,190],"factor.":[101],"To":[102,202],"end,":[104],"we":[105,151,207],"describe":[106],"and":[107,136,146,217,255],"analyze":[108,208],"offline":[111],"PTAS":[112,121,140,156],"problem.":[118],"Although":[119],"more":[124],"general":[125],"was":[127],"known":[128],"prior":[129],"our":[131,139,155,172],"work":[132],"(Kellerer":[133],"1999,":[134],"Chekuri":[135],"Khanna":[137],"2006),":[138],"is":[141,169,179],"arguably":[142],"simpler":[143],"state":[145],"analyze.":[147],"As":[148],"result,":[150],"could":[152],"easily":[153],"adapt":[154],"obtain":[158],"advice-complexity":[160],"result.\r\n\r\nWe":[161],"also":[162],"consider":[163],"whether":[164],"dependence":[166],"necessary":[170],"algorithm.":[173],"show":[175],"if":[177],"unrestricted":[180],"then":[181],"small":[183],"enough":[184],"eps":[185],">":[186],"0":[187],"obtaining":[188],"approximation":[191,218],"requires":[197],"Omega_eps(n)":[198],"advice.":[201],"establish":[203],"lower":[205],"bound":[206],"reduction":[211],"preserves":[213],"ratio":[219],"from":[220],"binary":[222],"separation":[223,269],"due":[225],"Boyar":[227],"et":[228],"al.":[229],"(2016).":[230],"define":[232],"two":[233,272],"natural":[234],"classes":[237,273],"capture":[239],"distinction":[241,249],"similar":[242],"Turing":[246],"machine":[247],"world":[248],"between":[250],"pseudo":[251],"polynomial":[252,256],"time":[253,257],"algorithms":[254],"Our":[259],"results":[260],"imply":[267],"world.":[278]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2963801096","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-04-15T23:35:03.562048","created_date":"2019-07-30"}