Approximation algorithms for scheduling problems

Autor: Jean-Claude Konig, Rodolphe Giroudeau

Publikováno v: Introduction to scheduling
A chapman and hall book. Introduction to scheduling, CRC press, pp.23-50, 2009
Chapman & Hall/CRC Computational Science ISBN: 9781420072730

International audience; complexity and approximation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86b4e6f1eeb8009c12fce10cff481e00
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00445575

Problèmes algorithmiques et de complexité dans les réseaux sans fil

Autor: Darties, Benoit

Publikováno v: Réseaux et télécommunications [cs.NI]. Université Montpellier II-Sciences et Techniques du Languedoc, 2007. Français

The last couple of years have seen the advent of wireless networks, doped by their ease of deployment and their use in multiple fields: personal WiFi networks, mobile telephony, ad hoc networks, sensors networks, ...The subject of this thesis relates

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ff48dfae465e55e84e6639a4d2cb0c2
https://tel.archives-ouvertes.fr/tel-00270118/file/thes.pdf