{"id":"https://openalex.org/W4316652484","doi":"https://doi.org/10.1137/1.9781611977554.ch143","title":"Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage","display_name":"Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4316652484","doi":"https://doi.org/10.1137/1.9781611977554.ch143"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977554.ch143","pdf_url":null,"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,"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,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5061507874","display_name":"Pallavi Jain","orcid":"https://orcid.org/0000-0002-2809-6783"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pallavi Jain","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024292541","display_name":"Lawqueen Kanesh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lawqueen Kanesh","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060986039","display_name":"Fahad Panolan","orcid":"https://orcid.org/0000-0001-6213-8687"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fahad Panolan","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016903720","display_name":"Souvik Saha","orcid":"https://orcid.org/0000-0002-2640-7533"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Souvik Saha","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049622510","display_name":"Abhishek Sahu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abhishek Sahu","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078823571","display_name":"Anannya Upasana","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anannya Upasana","raw_affiliation_string":"","raw_affiliation_strings":[]}],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":false,"cited_by_count":2,"cited_by_percentile_year":{"min":91,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3713","last_page":"3733"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Distributed Constraint Optimization Problems and Algorithms","score":0.8591,"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":"Distributed Constraint Optimization Problems and Algorithms","score":0.8591,"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/T11182","display_name":"Mechanism Design in Auctions and Procurement Contracts","score":0.855,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic Programming and Knowledge Representation","score":0.8138,"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":[{"keyword":"parameterized approximation scheme","score":0.5038},{"keyword":"sat","score":0.2896},{"keyword":"biclique-free","score":0.25}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7389834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7131084},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.59985805},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5513402},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5491141},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5288124},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5203142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49332133},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46969938},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.46480408},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.46399423},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4586267},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4460684},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41993016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32304072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10731232},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977554.ch143","pdf_url":null,"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,"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,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3163884806","https://openalex.org/W2018678447","https://openalex.org/W2952991316","https://openalex.org/W1842876744","https://openalex.org/W1988771411","https://openalex.org/W2565184432","https://openalex.org/W2068819940","https://openalex.org/W1645173339","https://openalex.org/W2949217681","https://openalex.org/W4239226376"],"ngrams_url":"https://api.openalex.org/works/W4316652484/ngrams","abstract_inverted_index":{"MAX-SAT":[0],"with":[1,20,55,88,146,158,226,251,260],"cardinality":[2],"constraint":[3,263],"(CC-MAX-SAT)":[4],"is":[5,49,77,81,92,99,114,293,309,331,398,422,447,458,468],"one":[6],"of":[7,72,144,179,200,324,327,329,366,410,496],"the":[8,47,70,97,111,169,195,201,265,276,281,307,325,363,403,414,430,437,471,477,494],"classical":[9],"NP-complete":[10],"problems,":[11],"that":[12,69,161,166,211,320,371,388],"generalizes":[13],"MAXIMUM":[14,139,242,277,438],"COVERAGE,":[15],"PARTIAL":[16,415],"VERTEX":[17,416],"COYER,":[18],"MAX-2-SAT":[19],"bisection":[21],"constraints,":[22],"and":[23,41,46,127,149,232,306,382,392,453,483,490],"has":[24],"been":[25],"extensively":[26],"studied":[27],"across":[28],"all":[29],"algorithmic":[30],"paradigms.":[31],"In":[32,95,358],"this":[33,188],"problem,":[34,412],"we":[35,182,189,248,273,428],"are":[36,238],"given":[37],"a":[38,42,65,154,159,294,302,312,384,407],"CNF-formula":[39],"\u03a6,":[40],"positive":[43,303],"integer":[44,304],"k,":[45],"goal":[48],"to":[50,61,83,101,152,176,310,402],"find":[51,311],"an":[52,85,206,219,337],"assignment":[53],"\u03b2":[54,76],"at":[56,332],"most":[57],"k":[58,164,361,395],"variables":[59],"set":[60,246,326,385],"true":[62],"(also":[63],"called":[64,239],"weight":[66],"k-assignment)":[67],"such":[68,319,370,387],"number":[71],"clauses":[73],"satisfied":[74],"by":[75,425,449,460,470],"maximized.":[78],"The":[79],"problem":[80,98,279,418,440],"known":[82],"admit":[84],"approximation":[86,227,339,434],"algorithm":[87,136,220,340,377,435],"factor":[89,155],",":[90,156],"which":[91],"probably":[93],"optimal.":[94],"fact,":[96],"hard":[100],"approximate":[102,138],"within":[103,153],"0.944,":[104],"assuming":[105,117],"Unique":[106],"Games":[107],"Conjecture,":[108],"even":[109,157,406],"when":[110],"input":[112,292],"formula":[113,202],"2-CNF.":[115],"Furthermore,":[116],"Gap-Exponential":[118],"Time":[119],"Hypothesis":[120],"(Gap-ETH),":[121],"for":[122,212,221,264,341,436],"any":[123,128],"\u03b5":[124,214],">":[125,215],"0":[126],"function":[129],"h,":[130],"no":[131],"h(k)(n":[132],"+":[133],"m)o(k)":[134],"time":[135,235,253,380],"can":[137,183],"COVERAGE":[140,243,278,439],"(a":[141],"monotone":[142],"version":[143],"CC-MAX-SAT)":[145],"n":[147],"elements":[148],"m":[150],"sets":[151,165],"promise":[160],"there":[162,217],"exist":[163],"fully":[167],"cover":[168],"whole":[170],"universe.These":[171],"intractable":[172],"results":[173],"lead":[174],"us":[175],"explore":[177],"families":[178],"formula,":[180],"where":[181],"circumvent":[184],"these":[185],"barriers.":[186],"Towards":[187],"consider":[190],"Kd,d-free":[191,224,245,351,442],"formulas":[192,225],"(that":[193],"is,":[194],"clause-variable":[196],"incidence":[197],"bipartite":[198,295,352,443],"graph":[199,296],"excludes":[203],"Kd,d":[204],"as":[205,280],"induced":[207],"subgraph).":[208],"We":[209,335],"show":[210],"every":[213],"0,":[216],"exists":[218],"CC-MAX-SAT":[222],"on":[223,244,350,441],"ratio":[228],"(1":[229],"\u2014":[230],"\u03b5)":[231],"running":[233,252,354],"in":[234,355,379,399],"(these":[236],"algorithms":[237],"FPT-AS).":[240],"For,":[241],"families,":[247],"obtain":[249],"FPT-AS":[250],".Our":[254],"second":[255],"result":[256],"considers":[257],"\u201coptimizing":[258],"k\u201d,":[259],"fixed":[261],"covering":[262],"Maximum":[266],"Coverage":[267],"problem.":[268,290],"To":[269],"explain":[270],"our":[271,376,411],"result,":[272],"first":[274],"recast":[275],"MAX":[282,342,420],"RED":[283,343],"BLUE":[284,344],"DOMINATING":[285,345],"SET":[286,346],"WITH":[287,347],"COVERING":[288,348],"CONSTRAINT":[289],"Here,":[291],"G":[297],"=":[298],"(A,":[299],"B,":[300],"E),":[301],"t,":[305,374],"objective":[308],"minimum":[313,364],"sized":[314],"subset":[315],"S":[316,367],"\u2286":[317,368],"A,":[318,369],"|N(S)|":[321,372],"(the":[322],"size":[323,365],"neighbors":[328],"S)":[330],"least":[333],"t.":[334],"design":[336],"additive":[338],"CONSTRAINT,":[349],"graphs,":[353],"FPT":[356],"time.":[357],"particular,":[359],"if":[360],"denotes":[362],"\u2265":[373,390],"then":[375],"runs":[378],"(kd)O(kd)nO(1)":[381],"returns":[383],"S'":[386],"|N(S')|":[389],"t":[391],"|S'|":[393],"\u2264":[394],"+1.":[396],"This":[397],"sharp":[400],"contrast":[401],"fact":[404],"that,":[405],"special":[408],"case":[409],"namely,":[413],"COVER":[417],"(or":[419],"k-VC)":[421],"W[1]-hard,":[423],"parameterized":[424,433],"k.":[426],"Thus,":[427],"get":[429],"best":[431],"possible":[432],"graphs.*":[444],"Pallavi":[445],"Jain":[446],"supported":[448,459,469],"Seed":[450],"Grant":[451,464],"(IITJ/R&D/2022-23/07)":[452],"SERB-SUPRA":[454],"Grant(SPR/2021/000860).":[455],"Lawqueen":[456],"Kanesh":[457],"EPSRC":[461],"Standard":[462],"Research":[463,473],"(EP/V044621/1).":[465],"Saket":[466],"Saurabh":[467],"European":[472,478],"Council":[474],"(ERC)":[475],"under":[476],"Union's":[479],"Horizon":[480],"2020":[481],"research":[482],"innovation":[484],"programme":[485],"(grant":[486],"agreement":[487],"No.":[488],"819416);":[489],"he":[491],"also":[492],"acknowledges":[493],"support":[495],"Swarnajayanti":[497],"Fellowship":[498],"grant":[499],"DST/SJF/MSA-01/2017-18.":[500]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4316652484","counts_by_year":[],"updated_date":"2024-03-17T01:43:42.708109","created_date":"2023-01-17"}