Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Online submodular maximization: beating 1/2 made simple
Niv Buchbinder
,
Moran Feldman
, Yuval Filmus
, Mohit Garg
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Online submodular maximization: beating 1/2 made simple'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Greedy Algorithm
100%
Submodular Maximization
100%
Maximization Problem
100%
Submodular Welfare Maximization
100%
Matroid
50%
Monotone Submodular Functions
50%
Approximation Ratio
50%
Competitive Ratio
50%
Online Environment
50%
Partition Matroid
50%
Natural Algorithms
50%
Combinatorial Auctions
50%
Mathematics
Greedy Algorithm
100%
Random Order
100%
Matroid
100%
Competitive Ratio
50%
Upper Bound
50%
Computer Science
Greedy Algorithm
100%
Competitive Ratio
50%
Approximation Ratio
50%
Subclasses
50%
Combinatorial Auction
50%
Proof
50%