- 8
- 6
- 1
- 1
MB
Marin Bougeret
16
Documents
Identifiants chercheurs
- marin-bougeret
- 0000-0002-9910-4656
- IdRef : 197511686
Présentation
Publications
- 5
- 5
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 16
- 16
- 11
- 6
- 5
- 2
- 1
- 1
- 6
- 6
- 6
- 2
- 1
- 1
- 1
- 1
- 2
- 4
- 5
- 3
|
Improved approximation algorithms for scheduling parallel jobs on identical clustersTheoretical Computer Science, 2015, 600, pp.70-85. ⟨10.1016/j.tcs.2015.07.003⟩
Article dans une revue
hal-01230293v1
|
Moderately exponential approximation for makespan minimization on related machinesTheoretical Computer Science, 2013, In press. ⟨10.1016/j.tcs.2013.03.020⟩
Article dans une revue
lirmm-00838717v1
|
|
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platformsDiscrete Mathematics, Algorithms and Applications, 2011, 3 (4), pp.553-586. ⟨10.1142/S1793830911001413⟩
Article dans une revue
hal-00796859v1
|
|
Approximating the discrete resource sharing scheduling problemInternational Journal of Foundations of Computer Science, 2011, 22 (3), ⟨10.1142/s0129054111008271⟩
Article dans une revue
hal-00796858v1
|
|
Tight approximation for scheduling parallel jobs on identical clustersIPDPSW: International Parallel and Distributed Processing Symposim, May 2012, Shangai, China. pp.878-885, ⟨10.1109/IPDPSW.2012.108⟩
Communication dans un congrès
hal-00738499v1
|
|
Scheduling jobs on heterogeneous platformsCOCOON, 2011, Dallas, United States
Communication dans un congrès
hal-00738508v1
|
|
Using oracles for the design of efficient approximation algorithmsMAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2011, Nymburk, Czech Republic
Communication dans un congrès
hal-00738513v1
|
|
A fast 5/2-approximation algorithm for hierarchical schedulingEUROPAR, 2010, Ischia, Italy
Communication dans un congrès
hal-00738518v1
|
|
Approximating the Non-contiguous Multiple Organization Packing Problem6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5_23⟩
Communication dans un congrès
hal-01054450v1
|
Approximating the Non-contiguous Multiple Organization Packing ProblemTCS: Theoretical Computer Science, 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5₂3⟩
Communication dans un congrès
hal-00798444v1
|
|
A fast \frac52-approximation algorithm for hierarchical schedulingProceedings of the 16th International EuroPar Conference, 2010, Ischia, Italy. pp.157-167
Communication dans un congrès
hal-00953419v1
|
|
Approximation Algorithms for Multiple Strip PackingApproximation and Online Algorithms, 2010, Copenhagen, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩
Communication dans un congrès
hal-00953421v1
|
|
The guess approximation technique and its application to the Discrete Resource Sharing Scheduling ProblemMAPSP, (the 9th workshop on Models and Algorithms for Planning and Scheduling Problems), 2009, Netherlands
Communication dans un congrès
hal-00806237v1
|
|
|
Approximation Algorithm for Multiple Strip PackingWAOA'2009: 7th Workshop on Approximation and Online Algorithms, Sep 2009, Copenhague, Denmark. pp.37-48, ⟨10.1007/978-3-642-12450-1_4⟩
Communication dans un congrès
hal-00738614v1
|
Combining Multiple Heuristics on Discrete ResourcesIPDPS, May 2009, Rome, Italy. pp.1-8, ⟨10.1109/IPDPS.2009.5160879⟩
Communication dans un congrès
hal-00688739v1
|
|
Tight Approximation for Scheduling Parallel Job on Identical ClustersRR-12001, 2012
Rapport
lirmm-00656780v1
|