Tung Anh Vu: (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs

G2OAT120 subscribers

About this video

Editorial review · 85% confidence

Round-10 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor/events) and provenance check passed; strict per-title check + final strict pass; oEmbed verified.

A 47-minute video from G2OAT: “Tung Anh Vu: (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs”.

Video by G2OAT, played through YouTube's embedded player.