{"id":"https://openalex.org/W4289655343","doi":"https://doi.org/10.1109/isit50566.2022.9834434","title":"Scheduling Group Tests over Time","display_name":"Scheduling Group Tests over Time","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655343","doi":"https://doi.org/10.1109/isit50566.2022.9834434"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834434","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026558035","display_name":"Akhil Bhimaraju","orcid":"https://orcid.org/0000-0003-0521-4967"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Akhil Bhimaraju","raw_affiliation_strings":["University of Illinois Urbana-Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065423139","display_name":"Lav R. Varshney","orcid":"https://orcid.org/0000-0003-2798-5308"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lav R. Varshney","raw_affiliation_strings":["University of Illinois Urbana-Champaign"],"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026558035"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":3.6335,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90462428,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"886","last_page":"891"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T11393","display_name":"Biosensors and Analytical Detection","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/pooling","display_name":"Pooling","score":0.8382358551025391},{"id":"https://openalex.org/keywords/group-testing","display_name":"Group testing","score":0.8299769163131714},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7832936644554138},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6911689043045044},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5842065215110779},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4866233766078949},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45389413833618164},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3008013367652893},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24052920937538147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14214345812797546},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1071925163269043}],"concepts":[{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.8382358551025391},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.8299769163131714},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7832936644554138},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6911689043045044},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5842065215110779},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4866233766078949},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45389413833618164},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3008013367652893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24052920937538147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14214345812797546},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1071925163269043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834434","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1964328125","https://openalex.org/W1975680434","https://openalex.org/W2004227827","https://openalex.org/W2012309514","https://openalex.org/W2048730512","https://openalex.org/W2053806044","https://openalex.org/W2054322995","https://openalex.org/W2060467808","https://openalex.org/W2067389921","https://openalex.org/W2082543584","https://openalex.org/W2089269509","https://openalex.org/W2148204686","https://openalex.org/W2158419847","https://openalex.org/W2173497155","https://openalex.org/W2322096602","https://openalex.org/W2780261041","https://openalex.org/W2908941128","https://openalex.org/W2912457157","https://openalex.org/W2947963424","https://openalex.org/W2963816967","https://openalex.org/W3004406280","https://openalex.org/W3092854183","https://openalex.org/W3120852108","https://openalex.org/W3157898849","https://openalex.org/W3187175611","https://openalex.org/W3196991668","https://openalex.org/W3198753271","https://openalex.org/W4223994564","https://openalex.org/W4287389611","https://openalex.org/W6787009019","https://openalex.org/W6788464406","https://openalex.org/W6788607597","https://openalex.org/W6794354618"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3090123594","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W4298106763","https://openalex.org/W2583614279","https://openalex.org/W4390751688"],"abstract_inverted_index":{"Group":[0],"testing":[1,10,53,60,87],"has":[2],"been":[3],"successful":[4],"in":[5,47],"minimizing":[6,78],"the":[7,25,39,64,75,79,111],"cost":[8,46,61],"of":[9,14,66,71,77,82,101],"a":[11,44,58,68,98,107],"large":[12,59],"batch":[13],"samples":[15,28,35,50],"by":[16,62],"pooling":[17,67],"them":[18],"together.":[19],"In":[20],"this":[21],"work,":[22],"we":[23,42],"study":[24],"setting":[26],"where":[27],"arrive":[29],"over":[30],"time.":[31],"Since":[32],"not":[33],"all":[34],"are":[36,94],"available":[37],"at":[38],"same":[40],"time,":[41],"incur":[43],"waiting":[45],"letting":[48],"many":[49],"accumulate.":[51],"However,":[52],"too":[54],"soon":[55],"leads":[56],"to":[57],"missing":[63],"benefits":[65],"larger":[69],"number":[70],"samples.":[72],"We":[73,104],"consider":[74],"problem":[76],"combined":[80],"objective":[81],"average":[83],"wait":[84],"time":[85],"plus":[86],"cost,":[88],"and":[89],"develop":[90],"online":[91,116],"algorithms":[92],"that":[93,114],"provably":[95],"competitive":[96,112],"for":[97],"broad":[99],"range":[100],"testing-cost":[102],"functions.":[103],"also":[105],"give":[106],"lower":[108],"bound":[109],"on":[110],"ratio":[113],"no":[115],"algorithm":[117],"can":[118],"beat.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}