{"id":"https://openalex.org/W7163988273","doi":"https://doi.org/10.1145/3798129.3800813","title":"Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks","display_name":"Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7163988273","doi":"https://doi.org/10.1145/3798129.3800813"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800813","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800813","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800813","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045656204","display_name":"Ishan Chakraborty","orcid":"https://orcid.org/0009-0005-3723-2942"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ishan Chakraborty","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"raw_orcid":"https://orcid.org/0009-0003-9931-878X","affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065331075","display_name":"Tanmay Inamdar","orcid":"https://orcid.org/0000-0002-0184-5932"},"institutions":[{"id":"https://openalex.org/I154549908","display_name":"Indian Institute of Technology Jodhpur","ror":"https://ror.org/03yacj906","country_code":"IN","type":"education","lineage":["https://openalex.org/I154549908"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Tanmay Inamdar","raw_affiliation_strings":["Indian Institute of Technology Jodhpur, Department of Computer Science and Engineering, Jodhpur, India"],"raw_orcid":"https://orcid.org/0000-0002-0184-5932","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Jodhpur, Department of Computer Science and Engineering, Jodhpur, India","institution_ids":["https://openalex.org/I154549908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001714646","display_name":"Ariel Kulik","orcid":"https://orcid.org/0000-0002-0533-3926"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Kulik","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0533-3926","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022257620","display_name":"Madhumita Kundu","orcid":"https://orcid.org/0000-0002-8562-946X"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Madhumita Kundu","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0002-8562-946X","affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138218788","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India","University of Bergen, Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0001-7847-6402","affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]},{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1003","last_page":"1013"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11060000211000443,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11060000211000443,"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.09549999982118607,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.03550000116229057,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5076000094413757},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.28369998931884766},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.27230000495910645},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.25529998540878296}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5076000094413757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.478300005197525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43639999628067017},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4180999994277954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40849998593330383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3939000070095062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31869998574256897},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800813","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800813","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800813","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800813","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5355697469","display_name":null,"funder_award_id":"819416","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W174535960","https://openalex.org/W1485150579","https://openalex.org/W1582617592","https://openalex.org/W1995725694","https://openalex.org/W1996472240","https://openalex.org/W2012700732","https://openalex.org/W2013415302","https://openalex.org/W2063835992","https://openalex.org/W2085312445","https://openalex.org/W2090277543","https://openalex.org/W2094388041","https://openalex.org/W2106515361","https://openalex.org/W2119741712","https://openalex.org/W2120358419","https://openalex.org/W2126442135","https://openalex.org/W2127114399","https://openalex.org/W2137118456","https://openalex.org/W2146221397","https://openalex.org/W2171796957","https://openalex.org/W2570081448","https://openalex.org/W2613846320","https://openalex.org/W2736712640","https://openalex.org/W2769672970","https://openalex.org/W2772354143","https://openalex.org/W2893188841","https://openalex.org/W2911549278","https://openalex.org/W2914414140","https://openalex.org/W2951611859","https://openalex.org/W2952332314","https://openalex.org/W2963378411","https://openalex.org/W2968783941","https://openalex.org/W3001868306","https://openalex.org/W3022139975","https://openalex.org/W3036402366","https://openalex.org/W3116963161","https://openalex.org/W3126320024","https://openalex.org/W4220653067","https://openalex.org/W4316652484","https://openalex.org/W4376651369","https://openalex.org/W4399522433","https://openalex.org/W4399522872","https://openalex.org/W4405463644","https://openalex.org/W4406142010","https://openalex.org/W4410232740","https://openalex.org/W4411319981","https://openalex.org/W4411320034","https://openalex.org/W6948338415","https://openalex.org/W6966861144","https://openalex.org/W7110444250"],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,11,37,53,64,74,78,81,123,136,161,180,212,215,222,249,262],"last":[2],"decade,":[3],"FPT":[4],"approximation":[5,65],"has":[6],"witnessed":[7],"tremendous":[8],"growth,":[9],"with":[10,33,189],"development":[12],"of":[13,36,48,55,86,217,228],"several":[14],"powerful":[15],"upper-":[16],"and":[17,115,152,207,256,260],"lower-bound":[18],"techniques.":[19],"Within":[20],"this":[21,87,113],"framework,":[22],"a":[23,68,92,105,164,209],"newly":[24],"emerging":[25],"direction":[26],"focuses":[27],"on":[28,77,125],"problems":[29,110,188,198],"that":[30,220,226],"admit":[31],"algorithms":[32,99],"running":[34,82],"time":[35],"form":[38],"ck":[39],"\u00b7":[40],"nO(1)":[41],"for":[42,95,241],"some":[43],"constant":[44],"c.":[45],"This":[46],"line":[47],"inquiry":[49],"naturally":[50],"leads":[51],"to":[52,108,185],"notion":[54],"time\u2013approximation":[56],"ratio":[57],"trade-offs":[58,119,240],"(or":[59],"time-ratio":[60],"trade-offs):":[61],"by":[62,121,133,160,237],"relaxing":[63],"guarantee":[66],"in":[67,80,112,163,245],"controlled":[69],"manner,":[70],"one":[71],"can":[72],"improve":[73],"exponential":[75],"dependence":[76],"parameter":[79],"time.":[83],"The":[84],"contribution":[85],"paper":[88],"is":[89,158,205],"threefold:":[90],"(i)":[91,248],"formal":[93],"language":[94],"parameterized":[96],"randomized":[97],"branching":[98],"(called":[100],"Oracle":[101],"Subset":[102],"Problems);":[103],"(ii)":[104,261],"meta-algorithm":[106],"applicable":[107],"all":[109,200],"expressible":[111],"language;":[114],"(iii)":[116],"new":[117],"time\u2013ratio":[118,239],"obtained":[120,236],"instantiating":[122],"framework":[124,251,267],"fundamental":[126],"problems,":[127,187],"including":[128],"Above-Guarantee":[129],"Vertex":[130,148,263],"Cover":[131,264],"(parameterized":[132],"excess":[134],"over":[135],"LP":[137,266],"lower":[138],"bound),":[139],"Odd":[140],"Cycle":[141,193],"Transversal,":[142],"Node":[143],"Multiway":[144],"Cut,":[145],"Subset/Group":[146],"Feedback":[147],"Set,":[149],"Min-Weight":[150],"d-SAT,":[151],"Matroid-Rank":[153],"d-Hitting":[154],"Set":[155],"(where":[156],"solution":[157],"measured":[159],"rank":[162],"matroid":[165],"accessible":[166],"via":[167],"an":[168],"independence":[169],"oracle),":[170],"among":[171],"others.":[172],"Our":[173],"applications":[174],"demonstrate":[175],"substantially":[176],"broader":[177],"applicability.":[178],"For":[179],"first":[181],"time,":[182],"they":[183],"apply":[184],"cut":[186],"parity":[190],"constraints":[191],"(Odd":[192],"Transversal),":[194],"\u201ccomplex\u201d":[195],"cycle":[196],"hitting":[197],"(hitting":[199],"cycles":[201,223],"whose":[202],"length":[203],"mod73":[204],"non-zero),":[206],"even":[208],"generalization":[210],"where":[211],"user":[213],"specifies":[214],"subset":[216,227],"vertices":[218,229],"such":[219],"only":[221],"passing":[224],"through":[225],"should":[230],"be":[231],"hit.":[232],"These":[233],"results":[234],"are":[235],"developing":[238],"two":[242],"meta-algorithms,":[243],"expressed":[244],"our":[246],"language:":[247],"biased-graph":[250],"[Wahlstr\u00f6m,":[252],"SODA":[253],"2017;":[254],"Lee":[255],"Wahlstr\u00f6m,":[257],"arXiv":[258],"2020],":[259],"above":[265],"[Lokshtanov":[268],"et":[269],"al.,":[270],"TALG":[271],"2014].":[272]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-06-10T00:00:00"}