Efficient Algorithms for Constructing (1+∊,β)-Spanners in the Distributed and Streaming Models

Distributed Computing - Germany
doi 10.1007/s00446-005-0147-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
MathematicsComputer Science
2002English

Additive Spanners and (Α, Β)-Spanners

ACM Transactions on Algorithms
Mathematics
2010English

Energy-Efficient and Adaptive Algorithms for Constructing Multipath Routing in Wireless Sensor Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Data Streaming Algorithms for Efficient and Accurate Estimation of Flow Size Distribution

2004English

New (Α, Β) Spanners and Hopsets

2020English

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners

2018English

Streaming Algorithms for Line Simplification

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2009English

Constructing Robust and Resilient Framework for Cooperative Video Streaming

2006English

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-Directed De Bruijn Graphs

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy