Pages that link to "Item:Q3395037"

The following pages link to Approximation Algorithms for Data Placement Problems (Q3395037):

Displaying 14 items.

• New approximation results for resource replication problems (Q270001) (← links)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Facility location models to locate data in information networks: a literature review (Q512996) (← links)
• Facility location with red-blue demands (Q1785285) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
• Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
• Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
• Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems (Q4624878) (← links)
• The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
• Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)