NDLI: Randomized and deterministic algorithms for geometric spanners of small diameter

Content Provider	IEEE Xplore Digital Library
Author	Arya, S. Mount, D.M. Smid, M.
Copyright Year	1994
Description	Author affiliation: Max-Planck-Inst. fur Inf., Saarbrucken, Germany (Arya, S.)
Abstract	Let S be a set of n points in IR/sup d/ and let t>1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and p. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D such that for any pair p and q of points there is a t-spanner path from p to q containing at most D edges. Randomized and deterministic algorithms are given for constructing t-spanners consisting of O(n) edges and having O(log n) diameter. Also, it is shown how to maintain the randomized t-spanner under random insertions and deletions. Previously, no results were known for spanners with low spanner diameter and for maintaining spanners under insertions and deletions.<>
Starting Page	703
Ending Page	712
File Size	930811
Page Count	10
File Format	PDF
ISBN	0818665807
DOI	10.1109/SFCS.1994.365722
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-11-20
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Euclidean distance Computer science Contracts Tree graphs Data structures
Content Type	Text
Resource Type	Article

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

Randomized and Deterministic Algorithms for Geometric Spanners of Small Diameter (1994)

Randomized and deterministic algorithms for geometric spanners of small diameter.

Randomized and deterministic algorithms for geometric spanners of small diameter

On Geometric Spanners of Euclidean and Unit Disk Graphs

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1999)

Improved Distance Oracles and Spanners for Vertex-Labeled Graphs

Randomized and deterministic algorithms for geometric spanners of small diameter

Similar Documents

Randomized and Deterministic Algorithms for Geometric Spanners of Small Diameter (1994)

Randomized and deterministic algorithms for geometric spanners of small diameter.

Randomized and deterministic algorithms for geometric spanners of small diameter

On Geometric Spanners of Euclidean and Unit Disk Graphs

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1994)

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (1999)

Improved Distance Oracles and Spanners for Vertex-Labeled Graphs

Randomized and deterministic algorithms for geometric spanners of small diameter