High Multiplicity Scheduling of File Transfers with Divisible Sizes on Multiple Classes of Paths

The algorithmic techniques presented in this paper were used by the first author in algorithmic programming contests (the attached zip archive contains a few sample contest tasks and solutions of the authors as well as official solutions from the respective contests). The IEEE Xplore link to the final published version of the paper is here: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=4559556&contentType=Conference+Publications&queryText%3DHigh+Multiplicity+Scheduling+of+File+Transfers+with+Divisible+Sizes+on+Multiple+Classes+of+Paths

Data and Resources

Additional Info

Field Value
Source Proceedings of the 12th IEEE International Symposium on Consumer Electronics (ISCE) (ISBN: 978-1-4244-2422-1)
Author Andreica, Mugurel Ionut, Tapus, Nicolae
Maintainer CCSD
Last Updated May 14, 2026, 15:15 (UTC)
Created May 14, 2026, 15:15 (UTC)
Identifier hal-00785996
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 Vilamoura, Portugal
creator Andreica, Mugurel Ionut
date 2008-04-14T00:00:00
harvest_object_id 20d65508-1d2b-49b9-91bd-3fdbff819950
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/doi/10.1109/ISCE.2008.4559556
set_spec type:COMM