{"id":"https://openalex.org/W2138260446","doi":"https://doi.org/10.1007/978-3-540-27810-8_27","title":"Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler","display_name":"Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2138260446","doi":"https://doi.org/10.1007/978-3-540-27810-8_27","mag":"2138260446"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27810-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_27","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/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstr. 40, 24098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Olshausenstr. 40, 24098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.891,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87101811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"311","last_page":"322"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7431467175483704},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.606214165687561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5811257362365723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5406225919723511},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5183480978012085},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5091378092765808},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4779551029205322},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44061994552612305},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4279648959636688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2952914535999298},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24012094736099243}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7431467175483704},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.606214165687561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5811257362365723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5406225919723511},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5183480978012085},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5091378092765808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4779551029205322},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44061994552612305},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4279648959636688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2952914535999298},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24012094736099243},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-27810-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_27","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W122708907","https://openalex.org/W1487188659","https://openalex.org/W1497640858","https://openalex.org/W1521979570","https://openalex.org/W1537319734","https://openalex.org/W1561272249","https://openalex.org/W1564540124","https://openalex.org/W1589421353","https://openalex.org/W1606095651","https://openalex.org/W1952648253","https://openalex.org/W1993161326","https://openalex.org/W1994736182","https://openalex.org/W2002272911","https://openalex.org/W2050328660","https://openalex.org/W2060963575","https://openalex.org/W2066883826","https://openalex.org/W2100172689","https://openalex.org/W2110526045","https://openalex.org/W2116636977","https://openalex.org/W2134422938","https://openalex.org/W2163656645","https://openalex.org/W2164859698","https://openalex.org/W2165956524","https://openalex.org/W2504554295","https://openalex.org/W3023226084","https://openalex.org/W4234119786"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W8322802","https://openalex.org/W314331466","https://openalex.org/W2049545441","https://openalex.org/W3120490799","https://openalex.org/W3033593267"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}