Multi-priority Graph Sparsification

Reyan Ahmed, Keaton Hamm, Stephen Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationCombinatorial Algorithms - 34th International Workshop, IWOCA 2023, Proceedings
EditorsSun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783031343469
StatePublished - 2023
Event34th International Workshop on Combinatorial Algorithms, IWOCA 2023 - Tainan, Taiwan, Province of China
Duration: Jun 7 2023Jun 10 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13889 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference34th International Workshop on Combinatorial Algorithms, IWOCA 2023
Country/TerritoryTaiwan, Province of China


  • approximation algorithms
  • graph spanners
  • sparsification

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Multi-priority Graph Sparsification'. Together they form a unique fingerprint.

Cite this