Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

DOI10.1007/11830924_14MaRDI QIDQ3595373zbMATH OpenOpenAlexFDO

Authors Rajiv Gandhi, Julián Mestre

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Combinatorial algorithms for data migration to minimize average completion time
• Scheduling problems over a network of machines
• Automata, Languages and Programming
• Improved results for data migration and open shop scheduling
• Data migration to minimize the total completion time

Cited in

(8)

• Combinatorial algorithms for data migration to minimize average completion time
• Complexity results for minimum sum edge coloring
• Improved results for data migration and open shop scheduling
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Improved Algorithms for Data Migration
• Data migration to minimize the total completion time
• Facility location models to locate data in information networks: a literature review
• Corrigendum: ``Improved results for data migration and open shop scheduling

This page was built for publication: Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595373)