Pages that link to "Item:Q4229425"
From MaRDI portal
The following pages link to Competitive On-Line Algorithms for Distributed Data Management (Q4229425):
Displayed 18 items.
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- New bounds for the controller problem (Q661061) (← links)
- Optimal algorithms for page migration in dynamic networks (Q1044046) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- Uniform page migration problem in Euclidean space (Q1736826) (← links)
- New results for online page replication (Q1887086) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- A \(3 + \Omega (1)\) lower bound for page migration (Q2196608) (← links)
- Asymptotically optimal online page migration on three points (Q2350908) (← links)
- On the competitive ratio for online facility location (Q2471804) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- New on-line algorithms for the page replication problem (Q5056163) (← links)
- Page migration with limited local memory capacity (Q5057429) (← links)
- On page migration and other relaxed task systems (Q5958713) (← links)
- Online algorithms for page replication in rings (Q5958716) (← links)
- On the Bahncard problem (Q5958720) (← links)