Distributed backup placement in networks
type: Item
instance of: scholarly article
title: Distributed backup placement in networks
zbMATH Open document ID: 1451.68048
author: Magnús M. Halldórsson
author: Sven Köhler
author: Boaz Patt-Shamir
author: Dror Rawitz
published in: Distributed Computing
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6858079
MaRDI profile type: Publication
full work available at URL: s00446-017-0299-x
OpenAlex ID: W2621150082
cites work: On the approximability of some degree-constrained subgraph problems
cites work: Complexity of network synchronization
cites work: The Competitiveness of On-Line Assignments
cites work: The Locality of Distributed Symmetry Breaking
cites work: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
cites work: Distributed 2-Approximation Algorithm for the Semi-matching Problem
cites work: A note on parallel complexity of maximum \(f\)-matching
cites work: The Convergence Time for Selfish Bin Packing
cites work: Convergence time to Nash equilibrium in load balancing
cites work: Faster algorithms for semi-matching problems
cites work: The price of anarchy for polynomial social cost
cites work: On Computing an Optimal Semi-matching
cites work: Assigning papers to referees
cites work: Distributed Approximation of k-Service Assignment
cites work: A faster distributed algorithm for computing maximal matchings deterministically
cites work: Semi-matchings for bipartite graphs and load balancing
cites work: On the complexity of approximating \(k\)-set packing
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Maximum semi-matching problem in bipartite graphs
cites work: An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
cites work: Distributed algorithms for covering, packing and maximum weighted matching
cites work: Improved Distributed Approximate Matching
cites work: Some simple distributed algorithms for sparse networks
cites work: Distributed approximation of cellular coverage
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Another look at the degree constrained subgraph problem
DOI: 10.1007/S00446-017-0299-X
description: scientific article; zbMATH DE number 6858079