Combinatorial algorithms for data migration to minimize average completion time
From MaRDI portal
Publication:1024212
DOI10.1007/s00453-007-9118-2zbMath1168.90015OpenAlexW2175640098MaRDI QIDQ1024212
Publication date: 16 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9118-2
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Related Items (6)
Security-aware database migration planning ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ Improved approximation algorithms for data migration ⋮ On a local protocol for concurrent file transfers ⋮ Scheduling Problems over Network of Machines ⋮ Scheduling problems over a network of machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity results for minimum sum edge coloring
- On chromatic sums and distributed resource allocation
- Approximation algorithms for shop scheduling problems with minsum objective
- Structure of a simple scheduling polyhedron
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Improved results for data migration and open shop scheduling
- On the $1.1$ Edge-Coloring of Multigraphs
- Improved Algorithms for Data Migration
- Scheduling File Transfers
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Algorithms for Data Migration with Cloning
- Data migration to minimize the total completion time
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- Adaptive Local Ratio
- Bounds for Certain Multiprocessing Anomalies
- Approximation and Online Algorithms
This page was built for publication: Combinatorial algorithms for data migration to minimize average completion time
