NDLI: Brief Announcement: Distributed Approximation for Tree Augmentation

Please wait, while we are loading the content...

Some Sequential Algorithms are Almost Always Parallel

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

Analyzing Contention and Backoff in Asynchronous Shared Memory

LCL Problems on Grids

Blockchains and the Future of Distributed Computing

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Recoverable Mutual Exclusion in Sub-logarithmic Time

Effectiveness of Delaying Timestamp Computation

Verifiable Outsourced Computation: A Survey

FruitChains: A Fair Blockchain

Greedy Routing and the Algorithmic Small-World Phenomenon

Towards Efficient Verification of Population Protocols

The Space Requirement of Local Forwarding on Acyclic Networks

A Layered Architecture for Erasure-Coded Consistent Distributed Storage

On the Multiparty Communication Complexity of Testing Triangle-Freeness

Distributed Approximation of Maximum Independent Set and Maximum Matching

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

Symmetry Breaking with Noisy Processes

Coordination Without Prior Agreement

Triangle Finding and Listing in CONGEST Networks

Clocked Population Protocols

Communication Primitives in Cognitive Radio Networks

Seeing is Believing: A Client-Centric Specification of Database Isolation

What Can be Sampled Locally?

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

Transactional Lock Elision Meets Combining

The Power of Choice in Priority Scheduling

Ignore or Comply?: On Breaking Symmetry in Consensus

Asynchronous Shared Channel

A Distributed Learning Dynamics in Social Groups

Broadcasting in Noisy Radio Networks

Space Complexity of Fault-Tolerant Register Emulations

Distributed MST and Routing in Almost Mixing Time

Optimal Distance Labeling Schemes for Trees

On Using Time Without Clocks via Zigzag Causality

A Template for Implementing Fast Lock-free Trees Using HTM

Life Beyond Set Agreement

Self-organized Segregation on the Grid

Brief Announcement: Population Protocols for Leader Election and Exact Majority with $O(log^{2}$ n) States and $O(log^{2}$ n) Convergence Time

Gossip in a Smartphone Peer-to-Peer Network

Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write

Distributed MIS via All-to-All Communication

Brief Announcement: How Large is your Graph?

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures

Adding Concurrency to Smart Contracts

Brief Announcement: Hierarchical Consensus

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks

Brief Announcement: Byzantine-Tolerant Machine Learning

Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers

Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination

Brief Announcement: Distributed Approximation for Tree Augmentation

Brief Announcement: Gossiping with Latencies

Brief Announcement: Statement Voting and Liquid Democracy

Brief Announcement: Secure Self-Stabilizing Computation

Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret

Brief Announcement: Fence Insertion for Straight-line Programs is in P

Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control

Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems

Brief Announcement: Rapid Asynchronous Plurality Consensus

Stateless Computation

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets

Brief Announcement: Object Oriented Consensus

Brief Announcement: Distributed Approximation for Tree Augmentation

Content Provider	ACM Digital Library
Author	Censor-Hillel, Keren Dory, Michal
Abstract	A minimum spanning tree (MST) is an essential structure for distributed algorithms, since it is a low-cost connected subgraph which provides an efficient way to communicate in a network. However, trees cannot survive even one link failure. In this paper, we study the Tree Augmentation Problem (TAP), for which the input is a graph G and a spanning tree T of G and the goal is to augment T with a minimum (or minimum weight) set of edges Aug from G, such that T ∪ Aug remains connected after a failure of any single link. Being central tasks for network design, TAP and additional connectivity augmentation problems have been well studied in the sequential setting. However, despite the distributed nature of these problems, they have not been studied in the distributed setting. We address this fundamental topic and provide a study of distributed TAP. In the full version of this paper, we present distributed 2-approximation algorithms for TAP, both for the unweighted and weighted versions, which have a time complexity of O(h) rounds, where h is the height of T. We also present a distributed 4-approximation for unweighted TAP that has a time complexity of O(√n log*n + D) rounds for a graph G with n vertices and diameter D, which is an improvement for large values of h. We complement our algorithms with lower bounds and some applications to related problems.
Starting Page	199
Ending Page	201
Page Count	3
File Format	PDF
ISBN	9781450349925
DOI	10.1145/3087801.3087842
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-07-25
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Connectivity augmentation Approximation algorithms Distributed network design
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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