Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths

The algorithmic techniques presented in this paper (particularly the block partitioning framework) were used as part of the official solutions for several tasks proposed by the author in the 2012 Romanian National Olympiad in Informatics (the statements and solutions for these tasks can be found in the attached zip archive).

Data and Resources

Additional Info

Field Value
Source Proceedings of the IEEE Romania International Conference "Communications", 2008 (ISBN: 978-606-521-008-0)
Author Andreica, Mugurel Ionut
Maintainer CCSD
Last Updated May 30, 2026, 00:14 (UTC)
Created May 30, 2026, 00:14 (UTC)
Identifier hal-00289575
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Parallel and Distributed Systems Laboratory [Bucarest] ; Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România] (UPB)
coverage Bucharest, Romania
creator Andreica, Mugurel Ionut
date 2008-06-05T00:00:00
harvest_object_id 9db62575-719b-4c4c-b609-6cd10c7b4479
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-01-14T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/0806.3827
set_spec type:COMM