( en | de | ru )

 

Disambiguation of "Nguyen, Kim Thang"

Author of the publication

copydeleteadd this publication to your clipboard
The local-global conjecture for scheduling with non-linear cost.

, , , and . J. Sched., 20 (3): 239-254 (2017)

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.

Manh-Thang Nguyen

Nhu Thang Nguyen

Thang Nguyen-Tat

Nguyen tat Thang

Quang-Thang Nguyen

 

Other publications of authors with the same name

Online Non-Monotone DR-Submodular Maximization., and . AAAI, page 9868-9876. AAAI Press, (2021)Online Scheduling of Bounded Length Jobs to Maximize Throughput., , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 116-127. Springer, (2009)Online Primal-Dual Algorithms with Configuration Linear Programs.. CoRR, (2017)Distributed Watermarking for Cross-Domain of Semantic Large Image Database., , and . INISCOM, volume 334 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 163-180. Springer, (2020)Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems., , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 35-46. Springer, (2015)Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling.. ESA, volume 8125 of Lecture Notes in Computer Science, page 755-766. Springer, (2013)Non-clairvoyant Scheduling Games., and . SAGT, volume 5814 of Lecture Notes in Computer Science, page 135-146. Springer, (2009)Online Decentralized Frank-Wolfe: From Theoretical Bound to Applications in Smart-Building., , , , and . GIOTS, volume 13533 of Lecture Notes in Computer Science, page 43-54. Springer, (2022)One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization., , and . ACML, volume 189 of Proceedings of Machine Learning Research, page 802-815. PMLR, (2022)An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints.. MFCS, volume 170 of LIPIcs, page 84:1-84:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)