Multi-Level Graph Sketches via Single-Level Solvers Article Swipe

MAKE IMPACT

Reyan Ahmed , Keaton Hamm , Mohammad Javad Latifi Jebelli , Stephen Kobourov , Faryad Darabi Sahneh , Richard Spence · YOU? · · 2019 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1905.00536

Given an undirected weighted graph $G(V,E)$, a constrained sketch over a terminal set $T\subset V$ is a subgraph $G'$ that connects the terminal vertices while satisfying a given set of constraints. Examples include Steiner trees (preserving connectivity among $T$) and subsetwise spanners (preserving shortest path distances up to a stretch factor). Multi-level constrained terminal sketches are generalizations in which terminal vertices require different levels or grades of service and each terminal pair is connected with edges of at least the minimum required level of the two terminals. This paper gives a flexible procedure for computing a broad class of multi-level graph sketches, which encompasses multi-level graph spanners, Steiner trees, and $k$--connected subgraphs as a few special cases. The proposed procedure is modular, i.e., it relies on availability of a single-level solver module (be it an oracle or approximation algorithm). One key result is that an $\ell$--level constrained terminal sketch can be computed with $\log\ell$ queries of the solver module while producing feasible solutions with approximation guarantees independent of $\ell$. Additionally, a new polynomial time algorithm for computing a subsetwise spanner is proposed. We show that for $k\in\N$, $\eps>0$, and $T\subset V$, there is a subsetwise $(2k-1)(1+\eps)$--spanner with total weight $O(|T|^\frac1kW(\ST(G,T)))$, where $W(\ST(G,T))$ is the weight of the Steiner tree of $G$ over the subset $T$. This is the first algorithm and weight guarantee for a multiplicative subsetwise spanner for nonplanar graphs. Numerical experiments are also done to illustrate the performance of the proposed algorithms.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1905.00536

PDF

https://arxiv.org/pdf/1905.00536

OA Status

green

Cited By

1

References

37

Related Works

10

OpenAlex ID

https://openalex.org/W2980729322

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2980729322

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1905.00536

Digital Object Identifier

Title

Multi-Level Graph Sketches via Single-Level Solvers

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2019

Year of publication

Publication date

2019-05-02

Full publication date if available

Authors

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

List of authors in order

Landing page

https://arxiv.org/abs/1905.00536

Publisher landing page

PDF URL

https://arxiv.org/pdf/1905.00536

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1905.00536

Direct OA link when available

Concepts

Computer science, Graph, Theoretical computer science

Top concepts (fields/topics) attached by OpenAlex

Cited by

1

Total citation count in OpenAlex

Citations by year (recent)

2020: 1

Per-year citation counts (last 5 years)

References (count)

37

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload