NDLI: Small Stretch Pairwise Spanners and Approximate $D$-Preservers

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Kavitha, Telikepalli Varma, Nithin M.
Copyright Year	2015
Abstract	Let $G = (V,E)$ be an undirected unweighted graph on $n$ vertices. A subgraph $H$ of $G$ is called a purely additive spanner of $G$ with stretch $\beta$ if for each $(u,v) \in V \times V$, the $u$-$v$ distance in $H$ is at most $\delta_G(u,v) + \beta$. We currently know sparse purely additive spanners with $\beta = O(1)$ only for $\beta = 2,4,6$. When $\beta = 2$, the size of the spanner is $O(n^{3/2})$; when $\beta = 4$, the size of the spanner is $O(n^{1.4}\log^{0.2}n)$; and when $\beta = 6$, the size of the spanner is $O(n^{4/3})$. The following is a natural relaxation of the above problem: we care for only certain distances, these are captured by the set $\mathcal{P} \subseteq V \times V$, and the problem is to construct a sparse subgraph $H$ (also called a $\mathcal{P}$-spanner), where for every $(u,v) \in \mathcal{P}$, the $u$-$v$ distance in $H$ is at most $\delta_G(u,v) + \beta$. In this paper we show algorithms to construct the following for $\beta = 2$: a $\mathcal{P}$-spanner of size $\tilde{O}(n\|\mathcal{P}\|^{1/3})$ for any $\mathcal{P}\subseteq V\times V$ and a $\mathcal{P}$-spanner of size $\tilde{O}(n\|\mathcal{P}\|^{1/4})$ when $\mathcal{P} = S \times V$, where $S \subseteq V$. Our $\mathcal{P}$-spanner with additive stretch 2 leads to a simple deterministic construction of a purely additive spanner with stretch 4 and size $O(n^{1.4}\log^{0.2}n)$. We also consider a variant of the $\mathcal{P}$-spanner problem where the set $\mathcal{P}$ is implicitly given via a distance threshold $D$. That is, $\mathcal{P} = \{(u,v): \delta_G(u,v) \ge D\}$. We refer to such a $\mathcal{P}$-spanner as an approximate $D$-preserver. A $D$-preserver is a subgraph where distances $\ge D$ are exactly preserved and $D$-preservers of size $O(n^2/D)$ are known. For a given $D \in \mathbb{Z}^+$ and any integer $k \ge 1$, we construct an $\tilde{O}(n^{3/2}/D^{k/(2k+2)})$-sized subgraph where distances $\ge D$ are approximated with an additive stretch of $4k$. In particular, when $k = \lfloor\log D\rfloor$, this subgraph has size $\tilde{O}(n\cdot\sqrt{n/D})$.
Starting Page	2239
Ending Page	2254
Page Count	16
File Format	PDF
ISSN	08954801
DOI	10.1137/140953927
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	4
Volume Number	29
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2015-11-10
Access Restriction	Subscribed
Subject Keyword	distance preservers Distance in graphs spanners Graph algorithms undirected graphs Analysis of algorithms
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Sparse Sourcewise and Pairwise Distance Preservers

Sparse Distance Preservers and Additive Spanners

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Collective tree spanners of graphs

Tree Spanners

Generating Low-Degree 2-Spanners

Small stretch spanners on dynamic graphs

Small stretch spanners on dynamic graphs (2005)

Small Stretch Pairwise Spanners and Approximate $D$-Preservers

Similar Documents

Sparse Sourcewise and Pairwise Distance Preservers

Sparse Distance Preservers and Additive Spanners

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Collective tree spanners of graphs

Tree Spanners

Generating Low-Degree 2-Spanners

Small stretch spanners on dynamic graphs

Small stretch spanners on dynamic graphs (2005)

Small Stretch Pairwise Spanners and Approximate $D$-Preservers