{"id":"https://openalex.org/W3043586888","doi":"https://doi.org/10.1137/1.9781611976465.179","title":"Non-uniform Geometric Set Cover and Scheduling on Multiple Machines","display_name":"Non-uniform Geometric Set Cover and Scheduling on Multiple Machines","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3043586888","doi":"https://doi.org/10.1137/1.9781611976465.179","mag":"3043586888"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611976465.179","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.179","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.179","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.179","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5059145110","display_name":"Jatin Batra","orcid":"https://orcid.org/0000-0002-7174-9778"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jatin Batra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6076,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.91471802,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3011","last_page":"3021"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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.9991999864578247,"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/cover","display_name":"Cover (algebra)","score":0.5873330235481262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5854307413101196},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4889932870864868},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47441762685775757},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36841878294944763},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29550501704216003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2403869330883026},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15935519337654114},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07929036021232605},{"id":"https://openalex.org/keywords/mechanical-engineering","display_name":"Mechanical engineering","score":0.06597179174423218}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5873330235481262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5854307413101196},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4889932870864868},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47441762685775757},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36841878294944763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29550501704216003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2403869330883026},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15935519337654114},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07929036021232605},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.06597179174423218}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9781611976465.179","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.179","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.179","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:publications/2c5cffde-3c49-4188-9b10-1f76fc3a8466","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2c5cffde-3c49-4188-9b10-1f76fc3a8466","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N & Batra, J 2021, Non-uniform geometric set cover and scheduling on multiple machines. in D Marx (ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Society for Industrial and Applied Mathematics (SIAM), pp. 3011-3021, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Alexandria, Virtual, United States, 10/01/21. https://doi.org/10.1137/1.9781611976465.179","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:30802","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/30802","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1137/1.9781611976465.179","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611976465.179","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.179","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G4405413375","display_name":null,"funder_award_id":"639.023.812","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3043586888.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1531964914","https://openalex.org/W1574334008","https://openalex.org/W1964001041","https://openalex.org/W1971622590","https://openalex.org/W1975581100","https://openalex.org/W1980092773","https://openalex.org/W1984628625","https://openalex.org/W1999396007","https://openalex.org/W2003902046","https://openalex.org/W2022671649","https://openalex.org/W2028747718","https://openalex.org/W2054459484","https://openalex.org/W2058787216","https://openalex.org/W2119142868","https://openalex.org/W2140049544","https://openalex.org/W2167816765","https://openalex.org/W2569078150","https://openalex.org/W2570727021","https://openalex.org/W2739825302","https://openalex.org/W2884202064","https://openalex.org/W2962723793","https://openalex.org/W2964063620","https://openalex.org/W2965699613","https://openalex.org/W2989553650"],"related_works":["https://openalex.org/W2383500046","https://openalex.org/W3145090562","https://openalex.org/W2295002667","https://openalex.org/W2951839510","https://openalex.org/W1567570895","https://openalex.org/W2043456971","https://openalex.org/W3006241023","https://openalex.org/W2377893369","https://openalex.org/W2154290910","https://openalex.org/W2566852150"],"abstract_inverted_index":{"We":[0,53,84],"consider":[1,162],"the":[2,59,63,71,79,88,141,145,200,211],"following":[3],"general":[4,163],"scheduling":[5,89,212],"problem":[6,90,100,213],"studied":[7],"recently":[8],"by":[9,112],"Moseley":[10],"[27].":[11,83],"There":[12],"are":[13],"n":[14],"jobs,":[15],"all":[16],"released":[17],"at":[18,151],"time":[19],"0,":[20],"where":[21,101],"job":[22],"j":[23],"has":[24],"size":[25,75],"pj":[26],"and":[27,77,135,149,169],"an":[28,55,153],"associated":[29],"arbitrary":[30,107],"non-decreasing":[31],"cost":[32,115],"function":[33],"fj":[34],"of":[35,117],"its":[36],"completion":[37],"time.":[38],"The":[39],"goal":[40],"is":[41,70],"to":[42,73,94,174,189,198,210,219],"find":[43],"a":[44,95,104,113,171,178,195],"schedule":[45],"on":[46,103,131],"m":[47],"machines":[48],"with":[49,106,120,166],"minimum":[50,74,114],"total":[51],"cost.":[52],"give":[54,170],"O(1)":[56,221],"approximation":[57],"for":[58,127,227],"problem,":[60],"improving":[61],"upon":[62],"previous":[64,206],"O(log":[65],"log":[66,155,202],"nP)":[67],"bound":[68],"(P":[69],"maximum":[72],"ratio),":[76],"resolving":[78],"open":[80],"question":[81],"in":[82,144,177,194,205],"first":[85],"note":[86],"that":[87,180],"can":[91],"be":[92,110],"reduced":[93],"clean":[96],"geometric":[97,142,184,192],"set":[98],"cover":[99,133],"points":[102],"line":[105],"demands,":[108],"must":[109],"covered":[111],"collection":[116],"given":[118],"intervals":[119],"non-uniform":[121,146,167],"capacity":[122,147],"profiles.":[123],"Unfortunately,":[124],"current":[125],"techniques":[126],"such":[128],"problems":[129,165],"based":[130],"knapsack":[132],"inequalities":[134],"low":[136],"union":[137],"complexity,":[138],"completely":[139,181],"lose":[140],"structure":[143],"profiles":[148],"incur":[150],"least":[152],"\u03a9(log":[154,201],"P)":[156,203],"loss.":[157],"To":[158],"this":[159,217],"end,":[160],"we":[161,215],"covering":[164,231],"capacities,":[168],"new":[172],"method":[173],"handle":[175],"capacities":[176],"way":[179,197],"preserves":[182],"their":[183],"structure.":[185],"This":[186],"allows":[187],"us":[188],"use":[190,216],"sophisticated":[191],"ideas":[193],"black-box":[196],"avoid":[199],"loss":[204],"approaches.":[207],"In":[208],"addition":[209],"above,":[214],"approach":[218],"obtain":[220],"or":[222],"inverse":[223],"Ackermann":[224],"type":[225],"bounds":[226],"several":[228],"basic":[229],"capacitated":[230],"problems.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}