## Approximation Algorithms for Data Management in Networks (2001)

### Cached

### Download Links

Citations: | 15 - 0 self |

### BibTeX

@MISC{Krick01approximationalgorithms,

author = {Christof Krick and Harald Räcke and Matthias Westermann},

title = {Approximation Algorithms for Data Management in Networks },

year = {2001}

}

### OpenURL

### Abstract

This paper deals with static data management in computer systems connected by networks. A basic functionality in these systems is the interactive

### Citations

270 | Approximation algorithms for facility location problems
- Shmoys, Tardos, et al.
- 1997
(Show Context)
Citation Context ...ar to the facility location problem. The major difference is that in the facility location problem there exists nothing comparable to the write requests in the data management problem. Aardal et. al. =-=[13]-=- gave the first constant factor approximation algorithm for the facility location problem. This was subsequently improved by Chudak and Shmoys [5, 6] who achieved the currently best known approximatio... |

209 | Improved combinatorial algorithms for facility location and k-median problems
- Charikar, Guha
- 1999
(Show Context)
Citation Context ... to Mahdian, Ye, and Zhang [13]. Their algorithm uses the ideas of cost scaling, a greedy algorithm of Jain, Mahdian, and Saberi [9], and a greedy augmentation procedure of Charikar, Guha, and Kuller =-=[5, 8]-=-. Further, Tamir [17] presents an algorithm for the uncapacitated metric facility location problem on trees. This dynamic programming algorithm calculates an optimal solution in time O(|V | 2 ) on a t... |

190 | Greedy strikes back: Improved facility location algorithms
- Guha, Khuller
- 1999
(Show Context)
Citation Context ...lem reduces to the uncapacitated metric facility location problem, if only read requests are considered. The MaxSNP-hardness of the uncapacitated metric facility location problem for arbitrary graphs =-=[8]-=- implies the same for the static data management problem on arbitrary networks. A large number of approximation algorithms are proposed for this facility location problem. Shmoys, Tardos, and Aardal [... |

164 |
Comparative Models of the File Assignment Problem
- Dowdy, Foster
- 1982
(Show Context)
Citation Context ...nteger programs and solving these programs efficiently by using heuristics. Here several models with different cost functions and constraints have been developed. The survey paper by Dowdy and Foster =-=[7]-=- gives an overview of this work. Recently and independently, Baev and Rajaraman [3] consider static data management in arbitrary networks with memory capacity constraints in a model that is similar to... |

149 | Analysis of a local search heuristic for facility location problems
- Korupolo, Plaxton
(Show Context)
Citation Context ...approximation ratio of 1 + 2/e ≈ 1.736. All these algorithms are based on solving linear programming relaxations of the facility location problem and rounding the obtained solutions. Korupolu et. al. =-=[8]-=- analyzed a well known local search heuristic and showed that it achieves an approximation factor of 5 + ɛ with ɛ > 0. 1.3 New results We introduce new deterministic algorithms for the static data man... |

123 | Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Chudak, Shmoys
(Show Context)
Citation Context ...uests in the data management problem. Aardal et. al. [13] gave the first constant factor approximation algorithm for the facility location problem. This was subsequently improved by Chudak and Shmoys =-=[5, 6]-=- who achieved the currently best known approximation ratio of 1 + 2/e ≈ 1.736. All these algorithms are based on solving linear programming relaxations of the facility location problem and rounding th... |

114 | Improved approximation algorithms for metric facility location problems
- Mahdian, Ye, et al.
- 2002
(Show Context)
Citation Context ...0] analyze a simple local search heuristic and show that it achieves an approximation factor of 5 + ε, for any ε > 0. The current best known approximation factor is 1.52 due to Mahdian, Ye, and Zhang =-=[13]-=-. Their algorithm uses the ideas of cost scaling, a greedy algorithm of Jain, Mahdian, and Saberi [9], and a greedy augmentation procedure of Charikar, Guha, and Kuller [5, 8]. Further, Tamir [17] pre... |

108 | Optimallycompetitive distributed file allocation
- AWERBUCH, BARTAL, et al.
- 1993
(Show Context)
Citation Context ... of the objects to the memory modules, possibly with redundancy, such that the total cost are minimized. In general, the goal in previous work was to minimize the total communication load (see, e.g., =-=[1, 2, 4, 9]-=-) which is defined as follows: The communication load of a link is the amount of data transmitted by this connection. The total communication load is the sum over the load of all links divided by the ... |

100 | Competitive algorithms for distributed data management
- Bartal, Fiat, et al.
- 1992
(Show Context)
Citation Context ... of the objects to the memory modules, possibly with redundancy, such that the total cost are minimized. In general, the goal in previous work was to minimize the total communication load (see, e.g., =-=[1, 2, 4, 9]-=-) which is defined as follows: The communication load of a link is the amount of data transmitted by this connection. The total communication load is the sum over the load of all links divided by the ... |

87 |
How to share memory in a distributed system
- Upfal, Wigderson
- 1987
(Show Context)
Citation Context ... particular, it does not include strategies that allow only a fraction of the copies to be updated in case of a write, which, e.g., is implemented in strategies using the majority trick introduced in =-=[14]-=-. However, all strategies using such techniques add time stamps to the copies. This requires that there is some definition of uniform time among different nodes. Since it is not clear how to realize t... |

81 | Improved approximation algorithms for capacitated facility location problems
- Chudak, Williamson
- 1999
(Show Context)
Citation Context ...uests in the data management problem. Aardal et. al. [13] gave the first constant factor approximation algorithm for the facility location problem. This was subsequently improved by Chudak and Shmoys =-=[5, 6]-=- who achieved the currently best known approximation ratio of 1 + 2/e ≈ 1.736. All these algorithms are based on solving linear programming relaxations of the facility location problem and rounding th... |

65 |
The multicast policy and its relationship to replicated data placement
- WOLFSON, MILO
- 1991
(Show Context)
Citation Context ...or approximation algorithm that aims to minimize the total cost. This algorithm is based on solving a linear programming relaxation of the problem and rounding the obtained solution. Milo and Wolfson =-=[15]-=- show that the static data management problem in arbitrary networks is already NP-hard in the total communication load model. Further, they present polynomial time algorithms for completely-connected ... |

61 | Approximation Algorithms for Data Placement
- Baev, Rajaraman
- 2001
(Show Context)
Citation Context ...veral models with different cost functions and constraints have been developed. The survey paper by Dowdy and Foster [7] gives an overview of this work. Recently and independently, Baev and Rajaraman =-=[3]-=- consider static data management in arbitrary networks with memory capacity constraints in a model that is similar to our model. The major difference is that they only consider read requests. They pre... |

59 | Distributed paging for general networks
- Awerbuch, Bartal, et al.
- 1998
(Show Context)
Citation Context ... of the objects to the memory modules, possibly with redundancy, such that the total cost are minimized. In general, the goal in previous work was to minimize the total communication load (see, e.g., =-=[1, 2, 4, 9]-=-) which is defined as follows: The communication load of a link is the amount of data transmitted by this connection. The total communication load is the sum over the load of all links divided by the ... |

50 |
An o(pn2) algorithm for the p-median and related problems on tree graphs
- TAMIR
- 1996
(Show Context)
Citation Context ...ang [13]. Their algorithm uses the ideas of cost scaling, a greedy algorithm of Jain, Mahdian, and Saberi [9], and a greedy augmentation procedure of Charikar, Guha, and Kuller [5, 8]. Further, Tamir =-=[17]-=- presents an algorithm for the uncapacitated metric facility location problem on trees. This dynamic programming algorithm calculates an optimal solution in time O(|V | 2 ) on a tree T = (V,E). 1.3 Ne... |

49 | Optimal allocation of electronic content
- Cidon, Kutten, et al.
- 2001
(Show Context)
Citation Context ...tions and constraints are considered. The survey paper of Dowdy and Foster [7] gives an overview concerning this work. Recently and independently, Baev and Rajaraman [3] and Cidon, Kutten, and Soffer =-=[6]-=- study static data management in a model that is similar to our model. The major difference is that they only consider read requests. Baev and Rajaraman [3] study static data management in arbitrary n... |

34 |
Exploiting locality for networks of limited bandwidth
- Maggs, Heide, et al.
- 1997
(Show Context)
Citation Context ...y. Thus, ct can also be seen as a distance function. To keep our algorithms and proofs simple and clear we often use this view of ct. The static data management problem is defined as follows (compare =-=[10]-=-). We are given a set X of shared data objects and the read and write request frequencies for each nodeobject pair which are described by the functions fr : V × X ↦−→ N and fw : V × X ↦−→ N, respectiv... |

33 |
On-line distributed data management
- Lund, Reingold, et al.
- 1994
(Show Context)
Citation Context |

14 |
Caching in networks
- Heide, Vöcking, et al.
- 2000
(Show Context)
Citation Context ...timal strategies that also aim to minimize the congestion on trees, meshes, and Internet-like clustered networks. These strategies are investigated in a competitive model. Meyer auf der Heide et. al. =-=[11, 12]-=- extend these results in the dynamic setting to non-uniform cost models with different communication costs for accessing and migrating data objects, to networks with memory capacity constraints, and o... |

10 | Provably good and practical strategies for non-uniform data management in networks
- Heide, Vöcking, et al.
- 1999
(Show Context)
Citation Context ...timal strategies that also aim to minimize the congestion on trees, meshes, and Internet-like clustered networks. These strategies are investigated in a competitive model. Meyer auf der Heide et. al. =-=[11, 12]-=- extend these results in the dynamic setting to non-uniform cost models with different communication costs for accessing and migrating data objects, to networks with memory capacity constraints, and o... |

7 | Competitive distributed allocation - Awerbuch, Bartal, et al. - 1993 |

2 |
Improved approximation algorithms for uncapitated facility location
- Chudak
- 1998
(Show Context)
Citation Context ...uests in the data management problem. Aardal et. al. [13] gave the first constant factor approximation algorithm for the facility location problem. This was subsequently improved by Chudak and Shmoys =-=[5, 6]-=- who achieved the currently best known approximation ratio of 1 + 2/e ≈ 1.736. All these algorithms are based on solving linear programming relaxations of the facility location problem and rounding th... |

1 | Comparative models of the assignment problem. Computing Surveys - Dowdy, Foster - 1982 |

1 | Comparative models of the file assignmentproblem - Dowdy, Foster - 1982 |

1 | Improved approximation algorithmsfor metric facility location problems - Mahdian, Ye, et al. - 2002 |

1 | Provably goodand practical strategies for non-uniform data management in networks - Heide, Vocking, et al. - 1999 |