Pages that link to "Item:Q2768361"

The following pages link to Approximation algorithms for data placement in arbitrary networks (Q2768361):

Displaying 15 items.

• New approximation results for resource replication problems (Q270001) (← links)
• Comparison and analysis of ten static heuristics-based Internet data replication techniques (Q436652) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
• Distributed backup placement in networks (Q1741963) (← links)
• Facility location with red-blue demands (Q1785285) (← links)
• Multi-objective evolutionary algorithms for a reliability location problem (Q2286920) (← links)
• Improved approximation algorithms for data migration (Q2429330) (← links)
• Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
• Bandwidth constrained placement in a WAN (Q2787675) (← links)
• Replica Placement on Directed Acyclic Graphs (Q2978515) (← links)
• Approximation Algorithms for Data Placement Problems (Q3395037) (← links)
• (Q4952620) (← links)
• The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (Q5138372) (← links)
• Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)