Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Online submodular maximization: beating 1/2 made simple
Buchbinder, Niv, Feldman, Moran, Filmus, Yuval, Garg, Mohit
Published in Mathematical programming (01.09.2020)
Published in Mathematical programming (01.09.2020)
Get full text
Journal Article
Natural Algorithms
Chazelle, Bernard
Published in Society for Industrial and Applied Mathematics and Association for Computing Machinery. Proceeding of the ACM-SIAM Symposium on Discrete Algorithms (01.01.2009)
Get full text
Published in Society for Industrial and Applied Mathematics and Association for Computing Machinery. Proceeding of the ACM-SIAM Symposium on Discrete Algorithms (01.01.2009)
Conference Proceeding
Competitive Flow Time Algorithms for Polyhedral Scheduling
Sungjin Im, Kulkarni, Janardhan, Munagala, Kamesh
Published in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (01.10.2015)
Published in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (01.10.2015)
Get full text
Conference Proceeding
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
Borodin, Allan, Jain, Aadhar, Lee, Hyun Chul, Ye, Yuli
Published in ACM transactions on algorithms (01.08.2017)
Published in ACM transactions on algorithms (01.08.2017)
Get full text
Journal Article