{"id":"https://openalex.org/W1515157528","doi":"https://doi.org/10.1137/s0097539700380754","title":"Approximating theDomatic Number","display_name":"Approximating theDomatic Number","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1515157528","doi":"https://doi.org/10.1137/s0097539700380754","mag":"1515157528"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539700380754","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700380754","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uriel Feige","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019056248","display_name":"Magn\u00fas M. Halld\u00f3rsson","orcid":"https://orcid.org/0000-0002-5774-8437"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Magn\u00fas M. Halld\u00f3rsson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","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":6.9209,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.97641734,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"32","issue":"1","first_page":"172","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9908000230789185,"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.822037398815155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.788416862487793},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7377840876579285},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5956733226776123},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5637089014053345},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.562170147895813},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45929402112960815},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4586832821369171},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.449984073638916},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44047677516937256},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4302406311035156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40447598695755005},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06781420111656189}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.822037398815155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.788416862487793},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7377840876579285},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5956733226776123},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5637089014053345},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.562170147895813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45929402112960815},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4586832821369171},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.449984073638916},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44047677516937256},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4302406311035156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40447598695755005},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06781420111656189},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539700380754","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539700380754","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W9957747","https://openalex.org/W1493071618","https://openalex.org/W1516590160","https://openalex.org/W1606480398","https://openalex.org/W1970259241","https://openalex.org/W1976963185","https://openalex.org/W2011039300","https://openalex.org/W2011112377","https://openalex.org/W2022392080","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2044013225","https://openalex.org/W2045801654","https://openalex.org/W2050228489","https://openalex.org/W2056090079","https://openalex.org/W2058422149","https://openalex.org/W2059453880","https://openalex.org/W2064796716","https://openalex.org/W2068871408","https://openalex.org/W2088414842","https://openalex.org/W2091112956","https://openalex.org/W2122406806","https://openalex.org/W2129939288","https://openalex.org/W2143180579","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2163322487","https://openalex.org/W3011766368","https://openalex.org/W3161056635","https://openalex.org/W4206780782","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W3037291746","https://openalex.org/W3004945501","https://openalex.org/W3164644441","https://openalex.org/W2561239406","https://openalex.org/W1760432569","https://openalex.org/W2788922840","https://openalex.org/W2257341650","https://openalex.org/W1856729396","https://openalex.org/W2007607373"],"abstract_inverted_index":{"A":[0],"set":[1,10,16,127],"of":[2,29,33,40,49,126,221],"vertices":[3,32],"in":[4,20,88],"a":[5,8,18,34,66,82,92,144,186,218],"graph":[6,35,64,184],"is":[7,27,105,169],"dominating":[9,42,76,196],"if":[11],"every":[12,63,140,183],"vertex":[13],"outside":[14],"the":[15,21,31,37,47,52,57,102,123,159,166,199],"has":[17,65,185],"neighbor":[19],"set.":[22],"The":[23],"domatic":[24,67,83,99,103,157,187,219],"number":[25,39,48,104,158],"problem":[26,163],"that":[28,62,80,138,150,168,182,216],"partitioning":[30],"into":[36,212],"maximum":[38,58],"disjoint":[41],"sets.":[43,224],"Let":[44],"n":[45],"denote":[46],"vertices,":[50],"$\\delta$":[51],"minimum":[53],"degree,":[54],"and":[55],"$\\Delta$":[56,206],"degree.":[59],"We":[60,112,179],"show":[61,114,137,181],"partition":[68,84,188,220],"with":[69,133,189],"$(1":[70,93,145,190],"-":[71,146,191],"o(1))(\\delta":[72,192],"+":[73,94,110,193],"1)/\\ln":[74,194],"n$":[75],"sets":[77],"and,":[78],"moreover,":[79],"such":[81],"can":[85,209],"be":[86,117,210],"found":[87],"polynomial-time.":[89],"This":[90,155,208],"implies":[91,149],"o(1))\\ln":[95],"n$-approximation":[96,148],"algorithm":[97,215],"for":[98,139],"number,":[100],"since":[101],"always":[106],"at":[107],"most":[108],"$\\delta":[109],"1$.":[111],"also":[113,180],"this":[115],"to":[116,165,172,203],"essentially":[118],"best":[119],"possible.":[120],"Namely,":[121],"extending":[122],"approximation":[124],"hardness":[125],"cover":[128],"by":[129],"combining":[130],"multiprover":[131],"protocols":[132],"zero-knowledge":[134],"techniques,":[135],"we":[136],"$\\epsilon":[141],">":[142],"0$,":[143],"\\epsilon)\\ln":[147],"$NP":[151],"\\subseteq":[152],"DTIME(n^{O(\\log\\log":[153],"n)})$.":[154],"makes":[156],"first":[160],"natural":[161],"maximization":[162],"(known":[164],"authors)":[167],"provably":[170],"approximable":[171],"within":[173],"polylogarithmic":[174],"factors":[175],"but":[176],"no":[177],"better.":[178],"\\Delta$":[195],"sets,":[197],"where":[198],"\"o(1)\"":[200],"term":[201],"goes":[202],"zero":[204],"as":[205],"increases.":[207],"turned":[211],"an":[213],"efficient":[214],"produces":[217],"$\\Omega(\\delta/\\ln":[222],"\\Delta)$":[223]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}