Distributed approximation of \(k\)-service assignment
type: Item
instance of: scholarly article
title: Distributed approximation of \(k\)-service assignment
zbMATH Open document ID: 1451.68347
author: Magnús M. Halldórsson
author: Sven Köhler
author: Dror Rawitz
published in: Distributed Computing
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 7040098
MaRDI profile type: Publication
full work available at URL: s00446-017-0321-3
OpenAlex ID: W2776370578
cites work: Complexity of network synchronization
cites work: A unified approach to approximating resource allocation and scheduling
cites work: Q3337223
cites work: On Multidimensional Packing Problems
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: An efficient approximation for the generalized assignment problem
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: Online Set Packing
cites work: On chromatic number of graphs and set-systems
cites work: Tight approximation algorithms for maximum general assignment problems
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: Distributed backup placement in networks
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: On the complexity of approximating \(k\)-set packing
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems
cites work: Distributed approximation of cellular coverage
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Flexible cell selection in cellular networks
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: An approximation algorithm for the generalized assignment problem
cites work: Improved Approximation Guarantees for Packing and Covering Integer Programs
DOI: 10.1007/S00446-017-0321-3
description: scientific article; zbMATH DE number 7040098