{"id":"https://openalex.org/W4409890884","doi":"https://doi.org/10.1137/24m1644079","title":"Stable Approximation Algorithms for Dominating Set and Independent Set","display_name":"Stable Approximation Algorithms for Dominating Set and Independent Set","publication_year":2025,"publication_date":"2025-04-28","ids":{"openalex":"https://openalex.org/W4409890884","doi":"https://doi.org/10.1137/24m1644079"},"language":"en","primary_location":{"id":"doi:10.1137/24m1644079","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1644079","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/360156273/24m1644079.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063418424","display_name":"Arpan Sadhukhan","orcid":"https://orcid.org/0000-0003-4048-7143"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Arpan Sadhukhan","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven 5612 DP, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08651356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"2","first_page":"921","last_page":"945"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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.9965999722480774,"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/T11182","display_name":"Auction Theory and Applications","score":0.9951000213623047,"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/mathematics","display_name":"Mathematics","score":0.7436184287071228},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7359073162078857},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6348774433135986},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6066832542419434},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5507684946060181},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.46777787804603577},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4596734642982483},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.451521098613739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17656990885734558},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1555369794368744},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0853385329246521}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7436184287071228},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7359073162078857},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6348774433135986},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6066832542419434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5507684946060181},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.46777787804603577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4596734642982483},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.451521098613739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17656990885734558},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1555369794368744},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0853385329246521},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/24m1644079","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1644079","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/bad7c189-d1e8-463a-8083-b6271b5e30d0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bad7c189-d1e8-463a-8083-b6271b5e30d0","pdf_url":"https://pure.tue.nl/ws/files/360156273/24m1644079.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M, Sadhukhan, A & Spieksma, F 2025, 'Stable Approximation Algorithms for Dominating Set and Independent Set', SIAM Journal on Discrete Mathematics, vol. 39, no. 2, pp. 921-945. https://doi.org/10.1137/24M1644079","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/bad7c189-d1e8-463a-8083-b6271b5e30d0","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/bad7c189-d1e8-463a-8083-b6271b5e30d0","pdf_url":"https://pure.tue.nl/ws/files/360156273/24m1644079.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M, Sadhukhan, A & Spieksma, F 2025, 'Stable Approximation Algorithms for Dominating Set and Independent Set', SIAM Journal on Discrete Mathematics, vol. 39, no. 2, pp. 921-945. https://doi.org/10.1137/24M1644079","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G3413111253","display_name":null,"funder_award_id":"NETWORKS","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6392329839","display_name":null,"funder_award_id":"NETWORKS-024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409890884.pdf","grobid_xml":"https://content.openalex.org/works/W4409890884.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1499357532","https://openalex.org/W1552828154","https://openalex.org/W2031490900","https://openalex.org/W2038643780","https://openalex.org/W2094067618","https://openalex.org/W2094683677","https://openalex.org/W2295092485","https://openalex.org/W2893780080","https://openalex.org/W2952999756","https://openalex.org/W3112807772","https://openalex.org/W4247656554","https://openalex.org/W4313020478","https://openalex.org/W4391684109"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4207084262","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/W2007607373"],"abstract_inverted_index":{"We":[0,15,49,66,72,110,157,225],"study":[1,50],"Dominating":[2,94,119],"Set":[3,6,95,120,180],"and":[4,60,151],"Independent":[5,179,203],"for":[7,21,93,102,118,178,187,202],"dynamic":[8,19,86,171,233],"graphs":[9,104,189],"in":[10,121,205],"the":[11,44,53,58,61,68,122,125,206,209,213,231],"vertex-":[12],"arrival":[13,45,126],"model.":[14],"say":[16],"that":[17,74,84,159,169],"a":[18,77,140,146,162,198,242],"algorithm":[20,59,92,177,201,229],"one":[22],"of":[23,46,57,105,128,190,212],"these":[24],"problems":[25],"is":[26,76,131,161,215],"k-stable":[27],"when":[28],"it":[29,64],"makes":[30],"at":[31,222],"most":[32],"k":[33,56],"changes":[34],"to":[35,230],"its":[36],"output":[37],"independent":[38],"set":[39,42],"or":[40],"dominating":[41],"upon":[43],"each":[47,129],"vertex.":[48],"trade-offs":[51],"between":[52],"stability":[54,97,116,182],"parameter":[55,98,183],"approximation":[62,149],"ratio":[63],"achieves.":[65],"obtain":[67],"following":[69],"results:":[70],"(i)":[71],"show":[73,158],"there":[75,160],"constant":[78,163,220],"\\varepsilon":[79,89,164,174],"\\ast":[80,90,165,175],">":[81,166],"0":[82,167],"such":[83,168],"any":[85,170],"(1":[87,172],"+":[88,143,173],")-approximation":[91,176],"has":[96,181],"\\Omega":[99,184],"(n),":[100,185],"even":[101,186],"bipartite":[103,188],"maximum":[106,191],"degree":[107,127,192,211],"4.":[108],"(ii)":[109],"present":[111,197],"algorithms":[112],"with":[113],"very":[114],"small":[115],"parameters":[117],"setting":[123,207],"where":[124,208,235],"vertex":[130],"upper":[132,216],"bounded":[133,217],"by":[134,218],"d.":[135],"In":[136],"particular,":[137],"we":[138,196],"give":[139],"1-stable":[141],"(d":[142],"1)2-approximation":[144],"algorithm,":[145,150],"3-stable":[147],"(9d/2)-":[148],"an":[152],"O(d)-stable":[153],"O(1)-approximation":[154],"algorithm.":[155,245],"(iii)":[156],"3.":[193],"(iv)":[194],"Finally,":[195],"2-stable":[199],"O(d)-approximation":[200,244],"Set,":[204],"average":[210],"graph":[214],"some":[219],"d":[221],"all":[223],"times.":[224],"extend":[226],"this":[227],"latter":[228],"fully":[232],"model":[234],"vertices":[236],"can":[237],"also":[238],"be":[239],"deleted,":[240],"achieving":[241],"6-stable":[243]},"counts_by_year":[],"updated_date":"2026-03-22T08:09:32.410652","created_date":"2025-10-10T00:00:00"}