{"id":"https://openalex.org/W2160834479","doi":"https://doi.org/10.1007/s10107-013-0651-2","title":"Preemptive and non-preemptive generalized min sum set cover","display_name":"Preemptive and non-preemptive generalized min sum set cover","publication_year":2013,"publication_date":"2013-03-07","ids":{"openalex":"https://openalex.org/W2160834479","doi":"https://doi.org/10.1007/s10107-013-0651-2","mag":"2160834479"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-013-0651-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0651-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.archives-ouvertes.fr/hal-00678169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry,  CV4 7AL, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry,  CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041229131","display_name":"Ruben van der Zwaan","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":"Ruben van der Zwaan","raw_affiliation_strings":["Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111449864"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.131,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82602377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/mathematics","display_name":"Mathematics","score":0.7690738439559937},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7276273965835571},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6638379096984863},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6458141207695007},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6319907307624817},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6199434995651245},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48777180910110474},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4746718406677246},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42825886607170105},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4001302421092987},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39255741238594055},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3429889976978302},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.297490656375885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1445910632610321}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7690738439559937},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7276273965835571},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6638379096984863},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6458141207695007},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6319907307624817},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6199434995651245},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48777180910110474},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4746718406677246},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42825886607170105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4001302421092987},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39255741238594055},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3429889976978302},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.297490656375885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1445910632610321},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s10107-013-0651-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0651-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:759604","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=759604","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.397.7992","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.397.7992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2012/3399/pdf/15.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.3764","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.3764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.ucmerced.edu/sim3/papers/pminsum%28journal%29_ver1.1.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00678169v1","is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-00678169","pdf_url":null,"source":{"id":"https://openalex.org/S4306421002","display_name":"Symposium on Theoretical Aspects of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science","raw_type":"\\ninfo:eu-repo/semantics/conferenceObject\\n"},{"id":"pmh:oai:HAL:hal-00678169v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00678169","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.465-476","raw_type":"Conference papers"},{"id":"pmh:oai:library.tue.nl:759604","is_oa":false,"landing_page_url":"http://repository.tue.nl/759604","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00678169v1","is_oa":true,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-00678169","pdf_url":null,"source":{"id":"https://openalex.org/S4306421002","display_name":"Symposium on Theoretical Aspects of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science","raw_type":"\\ninfo:eu-repo/semantics/conferenceObject\\n"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7190722005","display_name":null,"funder_award_id":"EP/J021814/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1508968115","https://openalex.org/W1531923436","https://openalex.org/W1973571353","https://openalex.org/W1978007997","https://openalex.org/W2000602248","https://openalex.org/W2090986925","https://openalex.org/W2100440346","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2134331592","https://openalex.org/W2147086810","https://openalex.org/W2148204686","https://openalex.org/W2152490496","https://openalex.org/W2165799042","https://openalex.org/W2166998862","https://openalex.org/W2175796269","https://openalex.org/W2295428206","https://openalex.org/W2577865170","https://openalex.org/W2963659614","https://openalex.org/W2988480584","https://openalex.org/W4231916799","https://openalex.org/W4244934433","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W2147086810","https://openalex.org/W2107689258","https://openalex.org/W2593080689","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W1496354680","https://openalex.org/W2102199239","https://openalex.org/W2885427910"],"abstract_inverted_index":{"In":[0],"the":[1,53,71,76,80,85,136,158,188,213,226],"(non-preemptive)":[2],"Generalized":[3],"Min":[4],"Sum":[5],"Set":[6],"Cover":[7],"Problem,":[8],"we":[9,219],"are":[10,118,168,184],"given":[11],"$$n$$":[12],"ground":[13],"elements":[14,50,83,90,146,165],"and":[15,110,125,127,151,182],"a":[16,34,65,152,172,203,208,217],"collection":[17],"of":[18,58,64,164,210],"sets":[19],"$$\\mathcal{S":[20],"}=":[21],"\\{S_1,":[22],"S_2,":[23],"\\ldots":[24],",":[25],"S_m\\}$$":[26],"where":[27,138],"each":[28],"set":[29,66,153],"$$S_i":[30],"\\in":[31],"2^{[n]}$$":[32],"has":[33,40],"positive":[35],"requirement":[36],"$$\\kappa":[37,88,161],"(S_i)$$":[38,89],"that":[39,79,145,195],"to":[41,47,51],"be":[42,148,200],"fulfilled.":[43],"We":[44,134,170,192],"would":[45],"like":[46],"order":[48],"all":[49,59],"minimize":[52],"total":[54],"(weighted)":[55],"cover":[56,62],"time":[57,63],"sets.":[60],"The":[61,142],"$$S_i$$":[67,92],"is":[68,140,144,155],"defined":[69],"as":[70],"first":[72,81],"index":[73],"$$j$$":[74,82],"in":[75,84,91,106,157,166,212],"ordering":[77,86],"such":[78],"contain":[87],".":[93],"This":[94],"problem":[95],"was":[96],"introduced":[97],"by":[98,120,206],"Azar":[99],"et":[100,122],"al.":[101,123],"(2009)":[102],"with":[103],"interesting":[104],"motivations":[105],"web":[107],"page":[108],"ranking":[109],"broadcast":[111],"scheduling.":[112],"For":[113],"this":[114,175],"problem,":[115],"constant":[116],"approximations":[117],"known":[119],"Bansal":[121],"(2010)":[124],"Skutella":[126],"Williamson":[128],"(Oper":[129],"Res":[130],"Lett":[131],"39(6):433\u2013436,":[132],"2011).":[133],"study":[135],"version":[137],"preemption":[139],"allowed.":[141],"difference":[143],"can":[147,199],"fractionally":[149],"scheduled":[150],"$$S$$":[154,167],"covered":[156],"moment":[159],"when":[160],"(S)$$":[162],"amount":[163],"scheduled.":[169],"give":[171],"2-approximation":[173],"for":[174,225],"preemptive":[176,197],"problem.":[177,228],"Our":[178],"linear":[179],"programming":[180],"relaxation":[181],"analysis":[183],"completely":[185],"different":[186],"from":[187],"aforementioned":[189],"previous":[190],"works.":[191],"also":[193],"show":[194],"any":[196],"solution":[198],"transformed":[201],"into":[202],"non-preemptive":[204,227],"one":[205],"losing":[207],"factor":[209],"6.2":[211],"objective":[214],"function.":[215],"As":[216],"byproduct,":[218],"obtain":[220],"an":[221],"improved":[222],"$$12.4$$":[223],"-approximation":[224]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}