Monge strikes again: Optimal placement of web proxies in the internet

DOI10.1016/S0167-6377(00)00041-9zbMath0970.90108OpenAlexW2154460528MaRDI QIDQ1593707

Gerhard J. Woeginger

Publication date: 21 October 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00041-9

zbMATH Keywords

optimizationdynamic programminginternetcachingMonge propertyMonge structureweb proxyweb server

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (11)

Online dynamic programming speedups ⋮ The web proxy location problem in general tree of rings networks ⋮ Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon ⋮ Designing cost-effective content distribution networks ⋮ Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries ⋮ Scheduling with Gaps: New Models and Algorithms ⋮ Improved algorithms for path partition and related problems ⋮ Exact algorithms for the joint object placement and request routing problem in content distribution networks ⋮ New algorithms for facility location problems on the real line ⋮ Scheduling with gaps: new models and algorithms ⋮ Weighted cache location problem with identical servers

Cites Work

• Geometric applications of a matrix-searching algorithm
• Perspectives of Monge properties in optimization
• Sequence comparison with mixed convex and concave costs
• The concave least-weight subsequence problem revisited
• On-line dynamic programming with applications to the prediction of RNA secondary structure

This page was built for publication: Monge strikes again: Optimal placement of web proxies in the internet