{"id":"https://openalex.org/W7138350456","doi":"https://doi.org/10.48550/arxiv.2603.14293","title":"Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems","display_name":"Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems","publication_year":2026,"publication_date":"2026-03-15","ids":{"openalex":"https://openalex.org/W7138350456","doi":"https://doi.org/10.48550/arxiv.2603.14293"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.14","is_oa":true,"landing_page_url":"https://openreview.net/forum?id=nNiWRRj6r9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://openreview.net/forum?id=nNiWRRj6r9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129698937","display_name":"Sujoy Bhore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhore, Sujoy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129738878","display_name":"Anupam Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Anupam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129739792","display_name":"Amit Kumar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kumar, Amit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.9846000075340271,"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.9846000075340271,"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.004699999932199717,"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.0038999998942017555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.7077999711036682},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6823999881744385},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6383000016212463},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.5702000260353088},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.526199996471405},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.423799991607666},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.37790000438690186},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.3544999957084656}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.7077999711036682},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6823999881744385},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6383000016212463},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.5702000260353088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5701000094413757},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.526199996471405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48989999294281006},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3619000017642975},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.3544999957084656},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.3368000090122223},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C102565666","wikidata":"https://www.wikidata.org/wiki/Q1378301","display_name":"Universal set","level":3,"score":0.32339999079704285},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2863999903202057},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.2784000039100647},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2667999863624573},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25850000977516174},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25450000166893005}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.socg.2026.14","is_oa":true,"landing_page_url":"https://openreview.net/forum?id=nNiWRRj6r9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2603.14293","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.14293","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.socg.2026.14","is_oa":true,"landing_page_url":"https://openreview.net/forum?id=nNiWRRj6r9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,11,23,47,107,121,125,142,160],"online":[2,49,70,88,109,147,167],"hitting":[3,50,89,110,148,168],"set":[4,51,53,77,96,111,114,149,153,169],"problem,":[5],"sets":[6,24,58],"arrive":[7],"over":[8],"time,":[9],"and":[10,32,52,59,94,164],"algorithm":[12,38,105],"has":[13],"to":[14,65],"maintain":[15],"a":[16,130,135],"subset":[17],"of":[18,137],"elements":[19],"that":[20],"hit":[21],"all":[22],"seen":[25],"so":[26],"far.":[27],"Alon,":[28],"Awerbuch,":[29],"Azar,":[30],"Buchbinder,":[31],"Naor":[33],"(SICOMP":[34],"2009)":[35],"gave":[36],"an":[37,100],"with":[39,116],"competitive":[40],"ratio":[41],"$O(\\log":[42,101],"n":[43,102],"\\log":[44],"m)$":[45],"for":[46,56,68,75,87,106,145,150],"(general)":[48],"cover":[54,91],"problems":[55],"$m$":[57],"$n$":[60],"elements;":[61],"this":[62,73,84],"is":[63],"known":[64],"be":[66],"tight":[67],"efficient":[69],"algorithms.":[71],"Given":[72],"barrier":[74],"general":[76,126,163],"systems,":[78],"we":[79,82,140],"ask:":[80],"can":[81],"break":[83],"double-logarithmic":[85,122],"phenomenon":[86],"set/set":[90],"on":[92,113],"structured":[93],"geometric":[95,152,165],"systems?":[97],"We":[98],"provide":[99],"\\log\\log":[103],"n)$-competitive":[104],"weighted":[108,146,166],"problem":[112],"systems":[115],"linear":[117],"shallow-cell":[118],"complexity,":[119],"replacing":[120],"factor":[123],"in":[124],"result":[127],"by":[128],"effectively":[129],"single":[131],"logarithmic":[132],"term.":[133],"As":[134],"consequence":[136],"our":[138],"results":[139],"obtain":[141],"first":[143],"bounds":[144],"natural":[151],"families,":[154],"thereby":[155],"answering":[156],"open":[157],"questions":[158],"regarding":[159],"gap":[161],"between":[162],"problems.":[170]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-18T00:00:00"}