Author of the publication

Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits.

, , and . Proc. ACM Meas. Anal. Comput. Syst., 5 (1): 09:1-09:31 (2021)

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.

 

Other publications of authors with the same name

A branch-and-cut algorithm for the partitioning-hub location-routing problem., , , and . Comput. Oper. Res., 38 (2): 539-549 (2011)Some Further Investigation on Maximum Throughput: Does Network Coding Really Help ?, and . page 1-8. (2012)Max-min fair survivable networks., , , and . Ann. des Télécommunications, 63 (9-10): 511-522 (2008)Computing optimal max-min fair resource allocation for elastic flows., , , and . IEEE/ACM Trans. Netw., 14 (6): 1272-1281 (2006)A study on load-balanced variants of the bin packing problem., and . CoRR, (2018)Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem., , , and . Comput. Oper. Res., (2021)Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation., , and . SIAM J. Sci. Comput., 15 (1): 16-35 (1994)Design of survivable IP-over-optical networks., , , and . Ann. Oper. Res., 146 (1): 41-73 (2006)The Economics of CDNs and Their Impact on Service Fairness., , , and . IEEE Trans. Network and Service Management, 14 (1): 22-33 (2017)Key technologies to accelerate the ICT Green evolution - An operator's point of view., , , , , , , , , and 10 other author(s). CoRR, (2019)