{"id":"https://openalex.org/W2044626237","doi":"https://doi.org/10.1007/1-4020-8141-3_19","title":"Approximation Algorithms for Mixed Fractional Packing and Covering Problems","display_name":"Approximation Algorithms for Mixed Fractional Packing and Covering Problems","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W2044626237","doi":"https://doi.org/10.1007/1-4020-8141-3_19","mag":"2044626237"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_19","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_19","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_19.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_19.pdf","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":["University of Kiel, Olshausenstr. 40, 24118, Kiel, Germany","Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Kiel, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Kiel, Olshausenstr. 40, 24118, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Universit\u00e4t Kiel, Kiel, Germany#TAB#","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":null,"apc_paid":null,"fwci":2.3385,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8931965,"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":"223","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9993000030517578,"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.9993000030517578,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9890999794006348,"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/packing-problems","display_name":"Packing problems","score":0.7788105010986328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5877575874328613},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5707680583000183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5700674653053284},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5191009044647217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49154433608055115},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43776342272758484},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.42051640152931213},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40937069058418274},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2962910532951355},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13021323084831238}],"concepts":[{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7788105010986328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5877575874328613},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5707680583000183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5700674653053284},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5191009044647217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49154433608055115},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43776342272758484},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.42051640152931213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40937069058418274},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2962910532951355},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13021323084831238},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/1-4020-8141-3_19","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_19","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_19.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/1-4020-8141-3_19","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_19","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_19.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2044626237.pdf","grobid_xml":"https://content.openalex.org/works/W2044626237.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W122708907","https://openalex.org/W1487188659","https://openalex.org/W1537319734","https://openalex.org/W1564540124","https://openalex.org/W1606095651","https://openalex.org/W1952648253","https://openalex.org/W1993161326","https://openalex.org/W2002272911","https://openalex.org/W2050328660","https://openalex.org/W2066883826","https://openalex.org/W2110526045","https://openalex.org/W2134422938","https://openalex.org/W2138260446","https://openalex.org/W2163656645","https://openalex.org/W2164859698","https://openalex.org/W2165956524"],"related_works":["https://openalex.org/W2950798640","https://openalex.org/W2733731843","https://openalex.org/W1496354680","https://openalex.org/W2077783414","https://openalex.org/W2462319175","https://openalex.org/W2163145578","https://openalex.org/W1996429835","https://openalex.org/W3174963230","https://openalex.org/W2991640891","https://openalex.org/W2205712007"],"abstract_inverted_index":{"We":[0,77],"propose":[1,78],"an":[2,17,72,79],"approximation":[3],"algorithm":[4,80,100],"based":[5],"on":[6],"the":[7,21,92,99,102,121,139,143],"Lagrangian":[8],"or":[9,74,89],"price":[10],"-":[11,57],"directive":[12],"decomposition":[13],"method":[14],"to":[15,91,112,120],"compute":[16],"\u2208-approximate":[18],"solution":[19],"of":[20,138,142],"mixed":[22,104,123],"fractional":[23,105,114],"packing":[24,106,115,124],"and":[25,49,53,61,107,116,119,125,133],"covering":[26,108,117,126],"problem:find":[27],"x":[28],"\u2208":[29],"B":[30,62,129],"such":[31],"that":[32,67,81,98],"f":[33,41],"(x)":[34],"\u2264":[35],"(1+\u2208)a,":[36],"g(x)":[37],"\u2265":[38],"(1\u2212\u2208)b":[39],"where":[40],"(x),g(x)":[42],"are":[43,55],"vectors":[44,60],"with":[45,128],"M":[46,56],"nonnegative":[47,59],"convex":[48,65],"concave":[50],"functions,":[51],"a":[52,64],"b":[54],"dimensional":[58],"is":[63,97],"set":[66],"can":[68],"be":[69],"queried":[70],"by":[71],"optimization":[73],"feasibility":[75],"oracle.":[76,93],"needs":[82],"only":[83],"O(M\u2208":[84],"\u22122":[85],"In(M\u2208":[86],"\u22121))":[87],"iterations":[88],"calls":[90],"The":[94],"main":[95],"contribution":[96],"solves":[101],"general":[103],"problem":[109,127],"(in":[110],"contrast":[111],"pure":[113],"problems":[118],"special":[122],"=\u211d":[130],"+":[131],")":[132],"runs":[134],"in":[135],"time":[136],"independent":[137],"so-called":[140],"width":[141],"problem.":[144]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}