{"id":"https://openalex.org/W1984520007","doi":"https://doi.org/10.1145/2486159.2486177","title":"A constant factor approximation algorithm for the storage allocation problem","display_name":"A constant factor approximation algorithm for the storage allocation problem","publication_year":2013,"publication_date":"2013-07-16","ids":{"openalex":"https://openalex.org/W1984520007","doi":"https://doi.org/10.1145/2486159.2486177","mag":"1984520007"},"language":"en","primary_location":{"id":"doi:10.1145/2486159.2486177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2486159.2486177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","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/A5019016353","display_name":"Reuven Bar-Yehuda","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Reuven Bar-Yehuda","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060468458","display_name":"Michael Beder","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Beder","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044026612","display_name":"Dror Rawitz","orcid":"https://orcid.org/0000-0003-0323-6097"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dror Rawitz","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019016353"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.0874,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79113111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"204","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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/rectangle","display_name":"Rectangle","score":0.8261036276817322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7211924195289612},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6683885455131531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6086313128471375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6065232753753662},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6052374839782715},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.534783124923706},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5182230472564697},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.5165216326713562},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.47955748438835144},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.47137650847435},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45369887351989746},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4474230408668518},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37466156482696533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34487491846084595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33183979988098145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.273796021938324},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15309518575668335},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10944202542304993},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.0952407717704773},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09409847855567932}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.8261036276817322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7211924195289612},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6683885455131531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6086313128471375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6065232753753662},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6052374839782715},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.534783124923706},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5182230472564697},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5165216326713562},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.47955748438835144},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.47137650847435},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45369887351989746},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4474230408668518},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37466156482696533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34487491846084595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33183979988098145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.273796021938324},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15309518575668335},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10944202542304993},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.0952407717704773},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09409847855567932},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2486159.2486177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2486159.2486177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1507141328","https://openalex.org/W1572977974","https://openalex.org/W1608651920","https://openalex.org/W2003902046","https://openalex.org/W2005960287","https://openalex.org/W2015752867","https://openalex.org/W2015840394","https://openalex.org/W2019905418","https://openalex.org/W2053460412","https://openalex.org/W2055037276","https://openalex.org/W2062918232","https://openalex.org/W2069417991","https://openalex.org/W2103363383","https://openalex.org/W2104685111","https://openalex.org/W2108031738","https://openalex.org/W2127719709","https://openalex.org/W2143474538","https://openalex.org/W2170344325","https://openalex.org/W2320198223","https://openalex.org/W2729451965","https://openalex.org/W6654536772","https://openalex.org/W6680812728"],"related_works":["https://openalex.org/W2078833192","https://openalex.org/W2042249499","https://openalex.org/W2398075730","https://openalex.org/W2165280361","https://openalex.org/W2379007225","https://openalex.org/W2117588054","https://openalex.org/W2774395669","https://openalex.org/W2087826159","https://openalex.org/W1969434948","https://openalex.org/W3214829809"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,12],"Storage":[3],"Allocation":[4],"Problem":[5,15],"(SAP)":[6],"which":[7,130],"is":[8,50,67],"a":[9,24,30,41,53,58,62,70,80,125],"variant":[10],"of":[11,23,33,77],"Unsplittable":[13],"Flow":[14],"on":[16],"Paths":[17],"(UFPP).":[18],"A":[19],"SAP":[20,120],"instance":[21],"consists":[22],"path":[25,54],"P":[26],"=":[27],"(V,E)":[28],"and":[29,44,61,79,97,110],"set":[31],"J":[32,49,76],"tasks.":[34],"Each":[35],"edge":[36],"e":[37,94],"\u2208":[38,48,95,101],"E":[39],"has":[40],"capacity":[42],"ce":[43],"each":[45],"task":[46],"j":[47],"associated":[51],"with":[52],"Ij":[55,105],"in":[56,129],"P,":[57],"demand":[59],"dj":[60],"weight":[63,72],"wj.":[64],"The":[65],"goal":[66],"to":[68],"find":[69],"maximum":[71],"subset":[73],"S":[74,102],"\u2286":[75],"tasks":[78],"height":[81],"function":[82],"h:S":[83],"\u2192":[84],"\u211c+":[85],"such":[86,103],"that":[87,104],"(i)":[88],"h(j)|+dj":[89],"\u2264":[90],"ce,":[91],"for":[92],"every":[93],"Ij;":[96],"(ii)":[98],"if":[99],"j,i":[100],"\u2229":[106],"Ii":[107],"\u2260":[108],"\u2205":[109],"h(j)":[111,115],"\u2265":[112,116],"h(i),":[113],"then":[114],"h(i)":[117],"+":[118],"di.":[119],"can":[121,132],"be":[122,133],"seen":[123],"as":[124],"rectangle":[126],"packing":[127],"problem":[128],"rectangles":[131],"moved":[134],"vertically,":[135],"but":[136],"not":[137],"horizontally.":[138]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}