Distributed approximation of \(k\)-service assignment
From MaRDI portal
Publication:1733389
DOI10.1007/s00446-017-0321-3zbMath1451.68347OpenAlexW2776370578MaRDI QIDQ1733389
Dror Rawitz, Magnús M. Halldórsson, Sven Köhler
Publication date: 21 March 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0321-3
Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Matching models (91B68) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Distributed approximation of cellular coverage
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- An efficient approximation for the generalized assignment problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Flexible cell selection in cellular networks
- Distributed backup placement in networks
- On the complexity of approximating \(k\)-set packing
- Online Set Packing
- Tight approximation algorithms for maximum general assignment problems
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Complexity of network synchronization
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- Distributed Computing: A Locality-Sensitive Approach
- On Multidimensional Packing Problems
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- On chromatic number of graphs and set-systems
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: Distributed approximation of \(k\)-service assignment
