( en | de | ru )

 

Disambiguation of "Sagnol, Guillaume"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal monitoring in large networks by Successive c-optimal Designs.

, , and . ITC, page 1-8. IEEE, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guillaume Pierre

Guillaume Klein

Guillaume Wendt

Guillaume Schurgers

Guillaume Weick

 

Other publications of authors with the same name

Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs.. Discret. Appl. Math., 161 (1-2): 258-276 (2013)The Price of Fixed Assignments in Stochastic Extensible Bin Packing., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 327-347. Springer, (2018)Optimal monitoring in large networks by Successive c-optimal Designs., , and . ITC, page 1-8. IEEE, (2010)Restricted Adaptivity in Stochastic Scheduling., and . ESA, volume 204 of LIPIcs, page 79:1-79:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks., , , and . GAMENETS, volume 105 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 224-235. Springer, (2012)An Extended Network Interdiction Problem for Optimal Toll Control., , and . Electron. Notes Discret. Math., (2016)Successive c-optimal designs: a scalable technique to optimize the measurements on large networks., , and . SIGMETRICS, page 347-348. ACM, (2010)Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing.. IWOCA, volume 13889 of Lecture Notes in Computer Science, page 343-355. Springer, (2023)Competitive Strategies for Symmetric Rendezvous on the Line., , , and . SODA, page 329-347. SIAM, (2022)Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling., , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 246-260. Springer, (2023)