{"id":"https://openalex.org/W1487188659","doi":"https://doi.org/10.1007/978-0-387-35608-2_22","title":"Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function","display_name":"Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1487188659","doi":"https://doi.org/10.1007/978-0-387-35608-2_22","mag":"1487188659"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-35608-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-35608-2_22.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-35608-2_22.pdf","any_repository_has_fulltext":null},"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/I3133086891","display_name":"Hochschule f\u00fcr Angewandte Wissenschaften Kiel","ror":"https://ror.org/03q0ab227","country_code":"DE","type":"education","lineage":["https://openalex.org/I3133086891"]},{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","Institute of Computer Science and Applied Mathematics, University of Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","institution_ids":["https://openalex.org/I3133086891"]},{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, University of Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024666296","display_name":"Hu Zhang","orcid":"https://orcid.org/0000-0002-6894-0926"},"institutions":[{"id":"https://openalex.org/I3133086891","display_name":"Hochschule f\u00fcr Angewandte Wissenschaften Kiel","ror":"https://ror.org/03q0ab227","country_code":"DE","type":"education","lineage":["https://openalex.org/I3133086891"]},{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hu Zhang","raw_affiliation_strings":["Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","Institute of Computer Science and Applied Mathematics, University of Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, University of Kiel, Germany","institution_ids":["https://openalex.org/I3133086891"]},{"raw_affiliation_string":"Institute of Computer Science and Applied Mathematics, University of Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.3411,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.99615877,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"255","last_page":"266"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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.9980999827384949,"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.9976999759674072,"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/solver","display_name":"Solver","score":0.7671880722045898},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7139137387275696},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6348575353622437},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6171145439147949},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5442476868629456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4752751886844635},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.47249189019203186},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4539598524570465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4537714421749115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4340501129627228},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3746166229248047},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37200313806533813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3327964246273041},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1158074140548706},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06784781813621521}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7671880722045898},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7139137387275696},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6348575353622437},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6171145439147949},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5442476868629456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4752751886844635},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.47249189019203186},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4539598524570465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4537714421749115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4340501129627228},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3746166229248047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37200313806533813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3327964246273041},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1158074140548706},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06784781813621521},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-0-387-35608-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-35608-2_22.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.2405","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2405","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-kiel.de/inf/Jansen/publications/TCS02.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-35608-2_22","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_22","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-35608-2_22.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1487188659.pdf","grobid_xml":"https://content.openalex.org/works/W1487188659.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W122708907","https://openalex.org/W1507186339","https://openalex.org/W1606095651","https://openalex.org/W1952648253","https://openalex.org/W1977360022","https://openalex.org/W1993161326","https://openalex.org/W2002272911","https://openalex.org/W2050328660","https://openalex.org/W2066883826","https://openalex.org/W2102201348","https://openalex.org/W2134422938","https://openalex.org/W2163656645","https://openalex.org/W2165956524"],"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/W1553604823","https://openalex.org/W8322802","https://openalex.org/W2195994862","https://openalex.org/W314331466","https://openalex.org/W4387635768"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5],"approximation":[6,62,89,97],"algorithm":[7,68,100],"based":[8],"on":[9,33],"a":[10,14,20,34,40,81],"Lagrangian":[11],"decomposition":[12],"via":[13],"logarithmic":[15,58],"potential":[16],"reduction":[17],"to":[18,46,77,108],"solve":[19],"general":[21],"packing":[22],"or":[23,59],"min-max":[24],"resource":[25],"sharing":[26],"problem":[27],"with":[28,49,55],"M":[29],"nonnegative":[30],"convex":[31,35],"constraints":[32],"set":[36],"B.":[37],"We":[38,64],"generalize":[39],"method":[41],"by":[42],"Grigoriadis":[43],"et":[44],"al":[45],"the":[47,67,78,85,88,92,99,109],"case":[48],"weak":[50],"approximate":[51],"block":[52,79,93,110],"solvers":[53],"(i.e.":[54],"only":[56],"constant,":[57],"even":[60],"worse":[61],"ratios).":[63],"show":[65],"that":[66],"needs":[69,101],"at":[70,102],"most":[71,103],"O(M(\u03b5":[72,104],"\u221221n\u03b5":[73],"\u22121":[74],"+lnM))":[75,106],"calls":[76,107],"solver,":[80],"bound":[82],"independent":[83],"of":[84,91],"data":[86],"and":[87],"ratio":[90],"solver.":[94,111],"For":[95],"small":[96],"ratios":[98],"\u22122":[105]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}