Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
From MaRDI portal
Publication:3595373
DOI10.1007/11830924_14zbMath1155.68576OpenAlexW2153194912MaRDI QIDQ3595373
Publication date: 28 August 2007
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.1498
Related Items (3)
Min Sum Edge Coloring in Multigraphs Via Configuration LP ⋮ Facility location models to locate data in information networks: a literature review ⋮ Complexity results for minimum sum edge coloring
This page was built for publication: Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
