{"id":"https://openalex.org/W1971371277","doi":"https://doi.org/10.1142/s179383091000067x","title":"COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY","display_name":"COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W1971371277","doi":"https://doi.org/10.1142/s179383091000067x","mag":"1971371277"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091000067x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091000067x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5056718928","display_name":"Peter Damaschke","orcid":"https://orcid.org/0000-0003-4047-7594"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"PETER DAMASCHKE","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026153657","display_name":"Azam Sheikh Muhammad","orcid":"https://orcid.org/0000-0001-6037-7019"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"AZAM SHEIKH MUHAMMAD","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056718928"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":1.5457,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.80975628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"02","issue":"03","first_page":"291","last_page":"311"},"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.9983000159263611,"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.9983000159263611,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.6839373111724854},{"id":"https://openalex.org/keywords/group-testing","display_name":"Group testing","score":0.6697669625282288},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6486217379570007},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6444934606552124},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5939881205558777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5353826284408569},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5173013210296631},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5137213468551636},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4913000464439392},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45211610198020935},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.42237481474876404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4197234511375427},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41130876541137695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3026263117790222},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.25166693329811096},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15022826194763184}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6839373111724854},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.6697669625282288},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6486217379570007},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6444934606552124},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5939881205558777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5353826284408569},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5173013210296631},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5137213468551636},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4913000464439392},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45211610198020935},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.42237481474876404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4197234511375427},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41130876541137695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3026263117790222},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25166693329811096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15022826194763184},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s179383091000067x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091000067x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:513100","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/fd4381f3-3795-414d-8bf5-e9abcca31a53","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W600184216","https://openalex.org/W1970360171","https://openalex.org/W1982865907","https://openalex.org/W2000489433","https://openalex.org/W2003144957","https://openalex.org/W2004227827","https://openalex.org/W2006834720","https://openalex.org/W2011318632","https://openalex.org/W2015172858","https://openalex.org/W2039212761","https://openalex.org/W2040374776","https://openalex.org/W2054082149","https://openalex.org/W2080318337","https://openalex.org/W2080407951","https://openalex.org/W2104350151","https://openalex.org/W2108078607","https://openalex.org/W2137509088","https://openalex.org/W2167973519","https://openalex.org/W2171327317","https://openalex.org/W2363970847","https://openalex.org/W3097993501","https://openalex.org/W3106239323"],"related_works":["https://openalex.org/W1566660502","https://openalex.org/W41549461","https://openalex.org/W1559081432","https://openalex.org/W113281379","https://openalex.org/W1994773828","https://openalex.org/W4300069928","https://openalex.org/W2950011768","https://openalex.org/W2053547515","https://openalex.org/W2098464890","https://openalex.org/W1997643965"],"abstract_inverted_index":{"Suppose":[0],"that":[1,37,76],"we":[2,71,139,240],"are":[3,55,59,123,165],"given":[4,205],"a":[5,14,27,32,38,53,78,85,96,126,141,192,204,214,232,243],"set":[6],"of":[7,11,42,82,99,191,207,237,245,247],"n":[8],"elements":[9],"d":[10,67,89],"which":[12],"have":[13],"property":[15],"called":[16,26],"defective.":[17,33],"A":[18,177],"group":[19,73,201],"test":[20],"can":[21],"check":[22],"for":[23,125,227],"any":[24,153,224],"subset,":[25],"pool,":[28],"whether":[29],"it":[30],"contains":[31],"It":[34],"is":[35,90,115,185],"known":[36,92],"nearly":[39,79],"optimal":[40,80,171],"number":[41,81],"O(d":[43,129,145],"log":[44,101,103,104,120,130,146,220],"(n/d))":[45,147],"pools":[46,83,110,148],"in":[47,57,68,149,196,251],"two":[48,163],"stages":[49,87,106,112,122,164],"(where":[50],"tests":[51],"within":[52],"stage":[54],"done":[56],"parallel)":[58],"sufficient,":[60],"but":[61],"then":[62],"the":[63,170,235],"searcher":[64],"must":[65],"know":[66],"advance.":[69],"Here":[70],"explore":[72],"testing":[74],"strategies":[75,250],"use":[77],"and":[84,107,174],"few":[86],"although":[88],"not":[91],"beforehand.":[93],"We":[94,212],"prove":[95],"lower":[97],"bound":[98],"\u03a9(":[100],"d/":[102],"d)":[105,121],"more":[108],"general":[109],"versus":[111],"tradeoff.":[113],"This":[114],"almost":[116],"tight,":[117],"since":[118],"O(":[119],"sufficient":[124],"strategy":[127,143,216],"with":[128,152,223],"n)":[131,221],"pools.":[132],"As":[133],"opposed":[134],"to":[135,186],"this":[136,238],"negative":[137],"result,":[138],"devise":[140],"randomized":[142,248],"using":[144,217],"three":[150],"stages,":[151],"desired":[154],"success":[155],"probability":[156],"1-\u03f5.":[157],"With":[158],"some":[159],"additional":[160],"measures":[161],"even":[162],"enough.":[166],"Open":[167],"questions":[168],"concern":[169],"constant":[172],"factors":[173],"practical":[175],"implications.":[176],"related":[178],"problem":[179],"motivated":[180],"by":[181,199],"biological":[182],"network":[183],"analysis":[184],"learn":[187],"hidden":[188],"vertex":[189,228],"covers":[190],"small":[193],"size":[194],"k":[195],"unknown":[197],"graphs":[198],"edge":[200],"tests.":[202],"(Does":[203],"subset":[206],"vertices":[208],"contain":[209],"an":[210],"edge?)":[211],"give":[213],"one-stage":[215],"O(k":[218],"3":[219],"pools,":[222],"parameterized":[225],"algorithm":[226],"cover":[229],"enumeration":[230],"as":[231],"decoder.":[233],"During":[234],"course":[236],"work":[239],"also":[241],"provide":[242],"classification":[244],"types":[246],"search":[249],"general.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}