Distributed backup placement in networks
From MaRDI portal
Publication:1741963
DOI10.1007/s00446-017-0299-xzbMath1451.68048OpenAlexW2621150082MaRDI QIDQ1741963
Boaz Patt-Shamir, Sven Köhler, Magnús M. Halldórsson, Dror Rawitz
Publication date: 11 April 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0299-x
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
Stochastic coordination in heterogeneous load balancing systems ⋮ Distributed approximation of \(k\)-service assignment ⋮ Distributed backup placement
Cites Work
- A note on parallel complexity of maximum \(f\)-matching
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- Distributed approximation of cellular coverage
- On the approximability of some degree-constrained subgraph problems
- Distributed algorithms for covering, packing and maximum weighted matching
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- The price of anarchy for polynomial social cost
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Another look at the degree constrained subgraph problem
- Assigning papers to referees
- On the complexity of approximating \(k\)-set packing
- Faster Algorithms for Semi-Matching Problems
- Maximum semi-matching problem in bipartite graphs
- The Convergence Time for Selfish Bin Packing
- A faster distributed algorithm for computing maximal matchings deterministically
- On Computing an Optimal Semi-matching
- Improved Distributed Approximate Matching
- The Locality of Distributed Symmetry Breaking
- Convergence time to Nash equilibrium in load balancing
- Complexity of network synchronization
- The Competitiveness of On-Line Assignments
- Distributed Computing: A Locality-Sensitive Approach
- Distributed 2-Approximation Algorithm for the Semi-matching Problem
- Some simple distributed algorithms for sparse networks
- Distributed Approximation of k-Service Assignment
- Semi-matchings for bipartite graphs and load balancing
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
