Abstract
The results of the preceding chapter show that the SCPP is very difficult to solve, even if only approximate solutions are required. We describe some approximation algorithms that can be used to give solutions to the problem, and decrease the gap between known solutions and nonapproximation results. We also consider practical heuristics to find good near-optimal solutions to the problem. We propose two general types of heuristics, based on complementary techniques, which can be used to give good starting solutions for the SCPP Oliveira et al. [2007].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Oliveira, C.A.S., Pardalos, P.M. (2011). Algorithms for Cache Placement. In: Mathematical Aspects of Network Routing Optimization. Springer Optimization and Its Applications(), vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0311-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0311-1_10
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0310-4
Online ISBN: 978-1-4614-0311-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)