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
Deterministic algorithms for submodular maximization problems
Niv Buchbinder
,
Moran Feldman
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Deterministic algorithms for submodular maximization problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Submodular Maximization
100%
Maximization Problem
100%
Deterministic Algorithm
100%
Submodular Function Maximization
100%
Derandomization
100%
Unconstrained Submodular Maximization
66%
Approximation Ratio
66%
Computer Science
33%
2-approximation
33%
Cardinality Constraint
33%
Submodular Function
33%
Randomized Algorithms
33%
Oracle
33%
Conditional Expectation
33%
Linear Formulation
33%
Marginal Value
33%
Computer Science
Approximation Ratio
100%
Fundamental Problem
50%
Approximation (Algorithm)
50%
Cardinality
50%
Randomized Algorithm
50%
Good Approximation
50%
Computer Science
50%
Mathematics
Derandomization
100%
Cardinality
33%
Good Approximation
33%
Conditional Expectation
33%
Extreme Points
33%