Weighted cache location problem with identical servers
From MaRDI portal
Publication:2336558
DOI10.1155/2014/586146zbMath1442.68011DBLPjournals/jam/WangD14OpenAlexW2029062798WikidataQ59053631 ScholiaQ59053631MaRDI QIDQ2336558
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/586146
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network protocols (68M12)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Monge strikes again: Optimal placement of web proxies in the internet
- On the 2-MRS problem in a tree with unreliable edges
- The web proxy location problem in general tree of rings networks
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
- A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges
This page was built for publication: Weighted cache location problem with identical servers