{"id":"https://openalex.org/W2163145578","doi":"https://doi.org/10.1051/ro:2002005","title":"Primal-dual approximation algorithms for a packing-covering pair of problems","display_name":"Primal-dual approximation algorithms for a packing-covering pair of problems","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2163145578","doi":"https://doi.org/10.1051/ro:2002005","mag":"2163145578"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2002005","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2002005","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2002005.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012249794","display_name":"Sofia Kovaleva","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Sofia Kovaleva","raw_affiliation_strings":["Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands; s.kovaleva@math.unimaas.nl","Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands; s.kovaleva@math.unimaas.nl","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Mathematics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Frits C.R. Spieksma","raw_affiliation_strings":["Department of Applied Economics, Katholieke Universiteit Leuven, Naamsestraat 69, 3000 Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Economics, Katholieke Universiteit Leuven, Naamsestraat 69, 3000 Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.346,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.6202001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"36","issue":"1","first_page":"53","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9993000030517578,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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/packing-problems","display_name":"Packing problems","score":0.811078667640686},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.7491000890731812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7309529781341553},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6747971773147583},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5794543027877808},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5283566117286682},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5271251797676086},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5066169500350952},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5048578381538391},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4926062226295471},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.48880311846733093},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48308899998664856},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4540990889072418},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4502800703048706},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42674359679222107},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4188097417354584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3739064037799835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17343416810035706}],"concepts":[{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.811078667640686},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.7491000890731812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7309529781341553},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6747971773147583},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5794543027877808},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5283566117286682},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5271251797676086},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5066169500350952},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5048578381538391},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4926062226295471},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.48880311846733093},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48308899998664856},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4540990889072418},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4502800703048706},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42674359679222107},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4188097417354584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3739064037799835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17343416810035706},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:2002005","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2002005","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/5cb1fbc2-75d8-4bcc-92dd-2cf130589f68","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/5cb1fbc2-75d8-4bcc-92dd-2cf130589f68","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kovaleva, S & Spieksma, FCR 2002, 'Primal-dual approximation algorithms for a packing-covering pair of problems', Rairo-Operations research, vol. 36, no. 1, pp. 53-71. https://doi.org/10.1051/ro:2002005","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:numdam.org:RO_2002__36_1_53_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2002005/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2002005.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2002__36_1_53_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2002005/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2002005.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2163145578.pdf","grobid_xml":"https://content.openalex.org/works/W2163145578.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1492069605","https://openalex.org/W1544515183","https://openalex.org/W1931458304","https://openalex.org/W1990180428","https://openalex.org/W1990313671","https://openalex.org/W2003902046","https://openalex.org/W2019062750","https://openalex.org/W2069832779","https://openalex.org/W2137560895","https://openalex.org/W2143391442","https://openalex.org/W2143474538","https://openalex.org/W2169212776","https://openalex.org/W2486715098","https://openalex.org/W3022173737"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W2075346653","https://openalex.org/W4247100793","https://openalex.org/W1969947867","https://openalex.org/W2077783414","https://openalex.org/W1496354680","https://openalex.org/W2044818254","https://openalex.org/W1966805076","https://openalex.org/W168093571"],"abstract_inverted_index":{"We":[0],"consider":[1,51],"a":[2,12,17,34,68,73,87],"special":[3],"packing-covering":[4],"pair":[5,45],"of":[6,15,32,54,60,89,91,95,107],"problems.":[7],"The":[8,43],"packing":[9,77],"problem":[10,28,31,44,78,83,134],"is":[11],"natural":[13],"generalization":[14],"finding":[16,33],"(weighted)":[18,35],"maximum":[19],"independent":[20],"set":[21],"in":[22,39,138],"an":[23,40,99,114],"interval":[24,41],"graph,":[25],"the":[26,30,52,58,76,81,104,121,132],"covering":[27,82,122,133],"generalizes":[29],"minimum":[36],"clique":[37],"cover":[38],"graph.":[42],"involves":[46],"weights":[47,56,109],"and":[48,57,79,110],"capacities;":[49],"we":[50,66,112,125],"case":[53,59,65,106],"unit":[55,61],"capacities.":[62],"In":[63],"each":[64,92],"describe":[67,113],"simple":[69],"algorithm":[70,119],"that":[71,84],"outputs":[72],"solution":[74],"to":[75,80],"are":[85],"within":[86,141],"factor":[88],"2":[90],"other.":[93],"Each":[94],"these":[96],"results":[97],"implies":[98],"approximative":[100],"min-max":[101],"result.":[102],"For":[103],"general":[105],"arbitrary":[108],"capacities":[111],"LP-based":[115],"(2":[116],"+":[117],"\u03b5)-approximation":[118],"for":[120],"problem.":[123],"Finally,":[124],"show":[126],"that,":[127],"unless":[128],"P":[129],"=":[130],"NP,":[131],"cannot":[135],"be":[136],"approximated":[137],"polynomial":[139],"time":[140],"arbitrarily":[142],"good":[143],"precision.":[144]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}