{"id":"https://openalex.org/W2672198376","doi":"https://doi.org/10.1007/3-540-45995-2_49","title":"Tight Bounds for Online Class-Constrained Packing","display_name":"Tight Bounds for Online Class-Constrained Packing","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2672198376","doi":"https://doi.org/10.1007/3-540-45995-2_49","mag":"2672198376"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45995-2_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_49","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/A5061815610","display_name":"Hadas Shachnai","orcid":"https://orcid.org/0000-0002-6645-4350"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hadas Shachnai","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, 600 Mountain Ave., 07974, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, 600 Mountain Ave., 07974, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084411441","display_name":"Tami Tamir","orcid":"https://orcid.org/0000-0002-8409-562X"},"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":"Tami Tamir","raw_affiliation_strings":["Department of Computer Science, Technion, 32000, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion, 32000, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37822165,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"569","last_page":"583"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9991999864578247,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.879278838634491},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8338708877563477},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6802568435668945},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6226513385772705},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6089765429496765},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6013203859329224},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5869635939598083},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5819131731987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5802050232887268},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48105716705322266},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.455111563205719},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4485911726951599},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4394576847553253},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.394449919462204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.349666953086853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3334994316101074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11920511722564697}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.879278838634491},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8338708877563477},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6802568435668945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6226513385772705},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6089765429496765},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6013203859329224},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5869635939598083},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5819131731987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802050232887268},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48105716705322266},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.455111563205719},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4485911726951599},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4394576847553253},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.394449919462204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.349666953086853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3334994316101074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11920511722564697},{"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.1007/3-540-45995-2_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_49","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W63422819","https://openalex.org/W1512794094","https://openalex.org/W1552828154","https://openalex.org/W1595545560","https://openalex.org/W1776713878","https://openalex.org/W1830700568","https://openalex.org/W1899332102","https://openalex.org/W1981405487","https://openalex.org/W1990313671","https://openalex.org/W2005908084","https://openalex.org/W2009394515","https://openalex.org/W2031666601","https://openalex.org/W2043862089","https://openalex.org/W2048905935","https://openalex.org/W2058200712","https://openalex.org/W2069939851","https://openalex.org/W2096095739","https://openalex.org/W2107344082","https://openalex.org/W2126257993","https://openalex.org/W2138183999","https://openalex.org/W2166185745","https://openalex.org/W2418222029","https://openalex.org/W6638000902"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W2214256523","https://openalex.org/W2042512761","https://openalex.org/W2070091108","https://openalex.org/W3089449646","https://openalex.org/W1830700568","https://openalex.org/W3022071589","https://openalex.org/W2114780236"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}