{"id":"https://openalex.org/W1608651920","doi":"https://doi.org/10.1007/3-540-47867-1_28","title":"Improved Approximation Algorithms for Resource Allocation","display_name":"Improved Approximation Algorithms for Resource Allocation","alternate_titles":[],"publication_year":2002,"publication_date":"2002-05-21","ids":{"openalex":"https://openalex.org/W1608651920","doi":"https://doi.org/10.1007/3-540-47867-1_28","mag":"1608651920"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-47867-1_28","doi":"https://doi.org/10.1007/3-540-47867-1_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47867-1_28","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,"listed_in":["cwts-core","jufo-1","ki-jl-1","norway-1","vabb-shw"],"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"},"parent_works":[{"id":"https://openalex.org/W4302308518","display_name":"Integer Programming and Combinatorial Optimization: 9th International IPCO Conference Cambridge, MA, USA, May 27\u201329, 2002 Proceedings","relationship":"volume"}],"lineage":["https://openalex.org/W1608651920","https://openalex.org/W4302308518"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5030046558","display_name":"Grui\u0103 C\u00e4linescu","orcid":"https://orcid.org/0000-0002-0925-9524","observed_orcids":["https://orcid.org/0000-0002-0925-9524"]},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gruia Calinescu","raw_affiliation_strings":["Department of Computer Science, Illinois Institute of Technology, Stuart Building, 10 West 31st Street, Chicago, IL, 60616"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Stuart Building, 10 West 31st Street, Chicago, IL, 60616","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180","observed_orcids":["https://orcid.org/0000-0003-3633-9180"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, 08544"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, 08544","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard J. Karloff","orcid":"https://orcid.org/0000-0003-4490-2324","observed_orcids":["https://orcid.org/0000-0003-4490-2324"]},"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,"raw_author_name":"Howard Karloff","raw_affiliation_strings":["AT&T Labs \u2014 Research, 180 Park Ave., Florham Park, NJ, 07932"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs \u2014 Research, 180 Park Ave., Florham Park, NJ, 07932","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544","observed_orcids":["https://orcid.org/0000-0001-7772-2544"]},"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":"Yuval Rabani","raw_affiliation_strings":["Computer Science Department, Technion \u2014 IIT, Haifa, 32000, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion \u2014 IIT, Haifa, 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4168,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.8056724,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"401","last_page":"414"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8432999849319458,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8432999849319458,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.04780000075697899,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.025499999523162842,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.9660000205039978},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7179999947547913},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.4790000021457672},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7580000162124634},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.515999972820282},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"resource constraints","score":0.4909999966621399},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.43299999833106995},{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","score":0.6150000095367432}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6925473213195801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6787508726119995},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.60386061668396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5667724609375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5299127101898193},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4383465647697449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42815470695495605},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4272496998310089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21698230504989624},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-47867-1_28","doi":"https://doi.org/10.1007/3-540-47867-1_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47867-1_28","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,"listed_in":["cwts-core","jufo-1","ki-jl-1","norway-1","vabb-shw"],"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.12.3213","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.technion.ac.il/~rabani/pss/Publications/CalinescuCKR01.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1507141328","https://openalex.org/W1992649763","https://openalex.org/W2003902046","https://openalex.org/W2005186378","https://openalex.org/W2014023522","https://openalex.org/W2015840394","https://openalex.org/W2049033541","https://openalex.org/W2093274793","https://openalex.org/W2156036190"],"related_works":["https://openalex.org/W1996971123","https://openalex.org/W2783815304","https://openalex.org/W2040756373","https://openalex.org/W2614943745","https://openalex.org/W1982222968","https://openalex.org/W2141024212","https://openalex.org/W1989589223","https://openalex.org/W2962866092","https://openalex.org/W45352664","https://openalex.org/W2808191361"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1608651920","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
