Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
DOI10.1007/S10479-013-1330-7zbMATH Open1303.90115OpenAlexW1988722832WikidataQ59398935 ScholiaQ59398935MaRDI QIDQ490221FDOQ490221
Authors: Maciej Drwal, Jerzy Józefczyk 
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1330-7
Recommendations
- Approximation Algorithms for Data Placement Problems
- Approximation algorithms for data placement in arbitrary networks
- scientific article; zbMATH DE number 1560358
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Quadratic programming (90C20) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- The design of approximation algorithms
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Approximation algorithms for data placement in arbitrary networks
- Approximation Algorithms for Data Placement Problems
- Rate control for communication networks: shadow prices, proportional fairness and stability
- The facility location problem with general cost functions
- Algorithms - ESA 2003
- Title not available (Why is that?)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Location science research: a review
- Configuration of fully replicated distributed database system over wide area networks
- Designing cost-effective content distribution networks
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Linear programming without the matrix
- An integer programming model for the allocation of databases in a distributed computer system
- Competitive On-Line Algorithms for Distributed Data Management
- Title not available (Why is that?)
- Title not available (Why is that?)
- Selfish caching in distributed systems
- Fully distributed algorithms for convex optimization problems
- Encyclopedia of Algorithms
Cited In (2)
This page was built for publication: Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490221)
