Distributed algorithms for weighted problems in sparse graphs
DOI10.1016/J.JDA.2005.07.006zbMATH Open1109.68132OpenAlexW1979561519MaRDI QIDQ866546FDOQ866546
Authors: Andrzej Czygrinow, Michal Hanckowiak 
Publication date: 14 February 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.07.006
Recommendations
approximation algorithmsdistributed algorithmsminimum-weight dominating setmaximum-weight matchingminimum-weight independent set
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cites Work
- Locality in Distributed Graph Algorithms
- Constant-time distributed dominating set approximation
- Distributed algorithm for approximating the maximum matching
- An efficient distributed algorithm for constructing small dominating sets
- Fast distributed construction of k-dominating sets and applications
- Deterministic coin tossing with applications to optimal parallel list ranking
- Distributed Weighted Matching
- Algorithms – ESA 2004
- Distributed Algorithm for Better Approximation of the Maximum Matching
Cited In (9)
- Distributed Weight Balancing Over Digraphs
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Fast Distributed Approximations in Planar Graphs
- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
- Distributed Approximation Algorithms for Planar Graphs
- Efficient Distributed Weighted Matchings on Trees
- Distributed Weighted Matching
- A new distributed approximation algorithm for the maximum weight independent set problem
This page was built for publication: Distributed algorithms for weighted problems in sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866546)
