Tight Approximability of the Server Allocation Problem for Real-Time Applications
- 28 January 2018
- book chapter
- Published by Springer Nature
- p. 41-55
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Computational time complexity of allocation problem for distributed servers in real-time applications2016
- Distributed processing communication scheme for real-time applications considering admissible delay2016
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization2014
- Hub location problems: A review of models, classification, solution techniques, and applicationsComputers & Industrial Engineering, 2013
- Network hub location problems: The state of the artEuropean Journal of Operational Research, 2008
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985