TY - GEN
T1 - Multi-priority Graph Sparsification
AU - Ahmed, Reyan
AU - Hamm, Keaton
AU - Kobourov, Stephen
AU - Jebelli, Mohammad Javad Latifi
AU - Sahneh, Faryad Darabi
AU - Spence, Richard
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - A sparsification of a given graph G is a sparser graph (typically a subgraph) which aims to approximate or preserve some property of G. Examples of sparsifications include but are not limited to spanning trees, Steiner trees, spanners, emulators, and distance preservers. Each vertex has the same priority in all of these problems. However, real-world graphs typically assign different “priorities” or “levels” to different vertices, in which higher-priority vertices require higher-quality connectivity between them. Multi-priority variants of the Steiner tree problem have been studied previously, but have been much less studied for other types of sparsifiers. In this paper, we define a generalized multi-priority problem and present a rounding-up approach that can be used for a variety of graph sparsifications. Our analysis provides a systematic way to compute approximate solutions to multi-priority variants of a wide range of graph sparsification problems given access to a single-priority subroutine.
AB - A sparsification of a given graph G is a sparser graph (typically a subgraph) which aims to approximate or preserve some property of G. Examples of sparsifications include but are not limited to spanning trees, Steiner trees, spanners, emulators, and distance preservers. Each vertex has the same priority in all of these problems. However, real-world graphs typically assign different “priorities” or “levels” to different vertices, in which higher-priority vertices require higher-quality connectivity between them. Multi-priority variants of the Steiner tree problem have been studied previously, but have been much less studied for other types of sparsifiers. In this paper, we define a generalized multi-priority problem and present a rounding-up approach that can be used for a variety of graph sparsifications. Our analysis provides a systematic way to compute approximate solutions to multi-priority variants of a wide range of graph sparsification problems given access to a single-priority subroutine.
KW - approximation algorithms
KW - graph spanners
KW - sparsification
UR - http://www.scopus.com/inward/record.url?scp=85164037861&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-34347-6_1
DO - 10.1007/978-3-031-34347-6_1
M3 - Conference contribution
AN - SCOPUS:85164037861
SN - 9783031343469
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 12
BT - Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Proceedings
A2 - Hsieh, Sun-Yuan
A2 - Hung, Ling-Ju
A2 - Lee, Chia-Wei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 34th International Workshop on Combinatorial Algorithms, IWOCA 2023
Y2 - 7 June 2023 through 10 June 2023
ER -