{"id":"https://openalex.org/W4226249744","doi":"https://doi.org/10.1137/23m1545975","title":"Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem","display_name":"Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem","publication_year":2024,"publication_date":"2024-02-09","ids":{"openalex":"https://openalex.org/W4226249744","doi":"https://doi.org/10.1137/23m1545975"},"language":"en","primary_location":{"id":"doi:10.1137/23m1545975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1545975","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://research.tue.nl/en/publications/7c9240eb-560b-444c-8935-281087355bdc","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":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-5770-3784","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, 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, the Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-4048-7143","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, 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, the Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-2547-3782","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00535756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1","first_page":"790","last_page":"827"},"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.9983000159263611,"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.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.716473400592804},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6826369762420654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5177159309387207},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5158213973045349},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4578157961368561},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4577014446258545},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4122107923030853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34215861558914185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1359039545059204}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.716473400592804},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6826369762420654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5177159309387207},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5158213973045349},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4578157961368561},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4577014446258545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4122107923030853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34215861558914185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1359039545059204},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/23m1545975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1545975","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/7c9240eb-560b-444c-8935-281087355bdc","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7c9240eb-560b-444c-8935-281087355bdc","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, Sadhukhan, A & Spieksma, F 2024, 'Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem', SIAM Journal on Discrete Mathematics, vol. 38, no. 1, pp. 790-827. https://doi.org/10.1137/23M1545975","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/7c9240eb-560b-444c-8935-281087355bdc","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85184849511","pdf_url":null,"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 2024, 'Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem', SIAM Journal on Discrete Mathematics, vol. 38, no. 1, pp. 790-827. https://doi.org/10.1137/23M1545975","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/7c9240eb-560b-444c-8935-281087355bdc","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7c9240eb-560b-444c-8935-281087355bdc","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, Sadhukhan, A & Spieksma, F 2024, 'Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem', SIAM Journal on Discrete Mathematics, vol. 38, no. 1, pp. 790-827. https://doi.org/10.1137/23M1545975","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"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"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W315629273","https://openalex.org/W1589175915","https://openalex.org/W1702576938","https://openalex.org/W1968997853","https://openalex.org/W2001398426","https://openalex.org/W2008581147","https://openalex.org/W2029437526","https://openalex.org/W2032612188","https://openalex.org/W2032841680","https://openalex.org/W2037900551","https://openalex.org/W2041411748","https://openalex.org/W2065845152","https://openalex.org/W2071845176","https://openalex.org/W2074863496","https://openalex.org/W2092910894","https://openalex.org/W2142389389","https://openalex.org/W2150852281","https://openalex.org/W2161965494","https://openalex.org/W2174718091","https://openalex.org/W2259315298","https://openalex.org/W2469267808","https://openalex.org/W2495802805","https://openalex.org/W2974337481","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W42550238","https://openalex.org/W7262867","https://openalex.org/W997982","https://openalex.org/W1364572","https://openalex.org/W59383121","https://openalex.org/W26903954","https://openalex.org/W58132005","https://openalex.org/W44704066","https://openalex.org/W39608911","https://openalex.org/W58525065"],"abstract_inverted_index":{"Let":[0],"P":[1,14],"be":[2,296],"a":[3,27,64,104,146,175,214,266,329],"set":[4],"of":[5,73,83,94,98,130,145,197,278],"points":[6,134],"in":[7,203,210,227,257,276,286,311,317],"\u211d<sup>d</sup>,":[8],"where":[9,183],"each":[10],"point":[11,105,305],"p":[12,25],"\u220a":[13],"has":[15],"an":[16,36,60,157,291,303],"associated":[17],"transmission":[18],"range,":[19],"denoted":[20],"p(p).":[21,43],"The":[22],"range":[23,129],"assignment":[24,75],"induces":[26],"directed":[28],"communication":[29],"graph":[30],"Gp(P)":[31,58],"on":[32,190,194],"P,":[33],"which":[34,123],"contains":[35,59],"edge":[37],"(p,":[38],"q)":[39],"iff":[40],"|pq|":[41],"\u227c":[42],"In":[44,86],"the":[45,49,54,69,74,80,92,95,128,138,143,184,195,208,228,234,255,262,279,283,300,308,315],"broadcast":[46],"range-assignment":[47],"problem,":[48],"goal":[50],"is":[51,76,106,156,170,225,265,275],"to":[52],"assign":[53],"ranges":[55,99],"such":[56,201],"that":[57,100,126,173,223,270,290,322],"arborescence":[61],"rooted":[62],"at":[63,131,302],"designated":[65],"root":[66],"node":[67],"and":[68,172,192,246,306,326],"cost":[70],"<sup>\u2211</sup><sub>p\u220aP</sub>":[71],"p(p)<sup>2</sup>":[72],"minimized.":[77],"We":[78,140,199,241],"study":[79,89,120,200],"dynamic":[81],"version":[82],"this":[84,117,224],"problem.":[85],"particular,":[87],"we":[88,119,212,221,268,288,319,327],"trade-offs":[90,202],"between":[91],"stability":[93,185],"solution-the":[96],"number":[97],"are":[101,124],"modified":[102],"when":[103,135,261],"inserted":[107],"into":[108],"or":[109,150],"deleted":[110],"from":[111],"P-and":[112],"its":[113],"approximation":[114,148,178,251],"ratio.":[115,252],"To":[116],"end":[118],"k-stable":[121],"algorithms,":[122],"algorithms":[125,248],"modify":[127],"most":[132],"k":[133],"they":[136],"update":[137,158],"solution.":[139],"also":[141,242,320],"introduce":[142],"concept":[144],"stable":[147],"scheme,":[149],"SAS":[151,155,215,232,272,324],"for":[152,162,233,282],"short.":[153],"A":[154],"algorithm":[159],"ALG":[160],"that,":[161,281],"any":[163,231],"given":[164],"fixed":[165],"parameter":[166,186],"\u03b5":[167,191],"&gt;":[168],"0,":[169],"k(\u03b5)stable":[171],"maintains":[174],"solution":[176,293],"with":[177,216,249],"ratio":[179],"1":[180],"+":[181],"\u03b5,":[182],"k(\u03b5)":[187,217,238],"only":[188],"depends":[189],"not":[193],"size":[196],"P.":[198],"three":[204],"settings.":[205],"(1)":[206],"For":[207,254,314],"problem":[209,235,256,285,310,316],"\u211d<sup>1</sup>,":[211],"present":[213,243,328],"=":[218,239],"O(1/\u03b5).":[219],"Furthermore,":[220],"prove":[222,269,289,321],"tight":[226],"worst":[229],"case:":[230],"must":[236],"have":[237],"\u03a9(1/\u03b5).":[240],"1-,":[244],"2-,":[245],"3-stable":[247],"constant":[250],"(2)":[253],"S<sup>1</sup>":[258],"(that":[259],"is,":[260],"underlying":[263],"space":[264],"circle)":[267],"no":[271,323],"exists.":[273],"This":[274],"spite":[277],"fact":[280],"static":[284],"S<sup>1</sup>,":[287],"optimal":[292],"can":[294],"always":[295],"obtained":[297],"by":[298],"cutting":[299],"circle":[301],"appropriate":[304],"solving":[307],"resulting":[309],"\u211d<sup>1</sup>.":[312],"(3)":[313],"\u211d<sup>2</sup>,":[318],"exists,":[325],"O(1)-stable":[330],"O(1)-approximation":[331],"algorithm.":[332]},"counts_by_year":[],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2022-05-05T00:00:00"}