{"id":"https://openalex.org/W7151456022","doi":"https://doi.org/10.48550/arxiv.2604.04912","title":"Dominating Set with Quotas: Balancing Coverage and Constraints","display_name":"Dominating Set with Quotas: Balancing Coverage and Constraints","publication_year":2026,"publication_date":"2026-04-06","ids":{"openalex":"https://openalex.org/W7151456022","doi":"https://doi.org/10.48550/arxiv.2604.04912"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04912","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04912","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.04912","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133139064","display_name":"Sobyasachi Chatterjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chatterjee, Sobyasachi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076062797","display_name":"Sushmita Gupta","orcid":"https://orcid.org/0000-0003-1255-8266"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Sushmita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133076777","display_name":"Saket Saurabh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saurabh, Saket","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085722117","display_name":"Sanjay Seetharaman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seetharaman, Sanjay","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078823571","display_name":"Anannya Upasana","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Upasana, Anannya","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":false,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6922000050544739,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6922000050544739,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.18199999630451202,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.0357000008225441,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/dominating-set","display_name":"Dominating set","score":0.7214000225067139},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.6852999925613403},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6844000220298767},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6105999946594238},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.48669999837875366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4629000127315521},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4059000015258789},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.3962000012397766}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7214000225067139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7088000178337097},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.6852999925613403},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6844000220298767},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6105999946594238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5546000003814697},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.48669999837875366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4708999991416931},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4629000127315521},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4059000015258789},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3497999906539917},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2655999958515167},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04912","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04912","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":"doi:10.48550/arxiv.2604.04912","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04912","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6749316453933716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,23,42,63,119,195,235,251,261],"natural":[3],"generalization":[4],"of":[5,70,89,121,160,254,258],"the":[6,87,109,157,207,244,255,265,271],"classical":[7,266],"\\textsc{Dominating":[8,12],"Set}":[9],"problem,":[10,19],"called":[11],"Set":[13],"with":[14,186,264],"Quotas}":[15],"(DSQ).":[16],"In":[17,169],"this":[18],"we":[20,154,171,210,233],"are":[21],"given":[22],"graph":[24,230],"\\(":[25,30,37,45,52,65,74,82,98,102,111,191],"G":[26],"\\),":[27,32,41,86,100,106],"an":[28,49],"integer":[29],"k":[31,75],"and":[33,48,127,222,224,269],"for":[34,79,204,238],"each":[35],"vertex":[36,81],"v":[38,83],"\\in":[39,84],"V(G)":[40,68,85],"lower":[43],"quota":[44,51],"\\mathrm{lo}_v":[46],"\\)":[47,69,76,193],"upper":[50],"\\mathrm{up}_v":[53],"\\).":[54,114],"The":[55],"goal":[56],"is":[57,147,214],"to":[58,97,150],"determine":[59],"whether":[60],"there":[61],"exists":[62],"set":[64],"S":[66,99],"\\subseteq":[67],"size":[71,221],"at":[72],"most":[73],"such":[77,133,183],"that":[78,95,156,173,212,275],"every":[80],"number":[88],"vertices":[90],"in":[91,135,163],"its":[92],"closed":[93],"neighborhood":[94],"belong":[96],"i.e.,":[101],"|N[v]":[103],"\\cap":[104],"S|":[105],"lies":[107],"within":[108],"range":[110],"[\\mathrm{lo}_v,":[112],"\\mathrm{up}_v]":[113],"This":[115],"richer":[116],"model":[117],"captures":[118],"variety":[120],"practical":[122],"settings":[123],"where":[124],"both":[125],"under-":[126],"over-coverage":[128],"must":[129],"be":[130,151],"avoided":[131],"--":[132,182,197],"as":[134,184,194],"fault-tolerant":[136],"infrastructure,":[137],"load-balanced":[138],"facility":[139],"placement,":[140],"or":[141,189],"constrained":[142],"communication":[143],"networks.":[144],"While":[145],"DS":[146,267],"already":[148],"known":[149],"computationally":[152],"hard,":[153],"show":[155,211],"added":[158],"expressiveness":[159],"per-vertex":[161],"quotas":[162],"DSQ":[164,174,213,239],"introduces":[165],"additional":[166],"algorithmic":[167,256],"challenges.":[168],"particular,":[170],"prove":[172],"becomes":[175],"\\W[1]-hard":[176],"even":[177],"on":[178,227,240],"structurally":[179],"sparse":[180],"graphs":[181,242],"those":[185],"degeneracy":[187],"2,":[188],"excluding":[190],"K_{3,3}":[192],"subgraph":[196],"despite":[198],"these":[199],"classes":[200],"admitting":[201],"FPT":[202],"algorithms":[203],"DS.":[205],"On":[206],"positive":[208],"side,":[209],"fixed-parameter":[215],"tractable":[216],"when":[217],"parameterized":[218],"by":[219],"solution":[220],"treewidth,":[223],"more":[225],"generally,":[226],"nowhere":[228],"dense":[229],"classes.":[231],"Furthermore,":[232],"design":[234],"subexponential-time":[236],"algorithm":[237],"apex-minor-free":[241],"using":[243],"bidimensionality":[245],"framework.":[246],"These":[247],"results":[248],"collectively":[249],"offer":[250],"refined":[252],"view":[253],"landscape":[257],"DSQ,":[259],"revealing":[260],"sharp":[262],"contrast":[263],"problem":[268],"identifying":[270],"key":[272],"structural":[273],"properties":[274],"govern":[276],"tractability.":[277]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-08T00:00:00"}