Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
Non-monotone
100%
Offline Algorithm
100%
Convex Set
100%
DR-submodular Maximization
100%
Polynomial Time
66%
Online Algorithms
66%
Inapproximability Results
66%
Set Constraints
66%
Machine Learning
33%
Approximation Ratio
33%
Approximation Algorithms
33%
Online Problem
33%
Real-world Application
33%
Closed Convex Sets
33%
Communication Systems
33%
DR-submodular
33%
DR-submodular Function
33%
Operations Research
33%
Exponential Time
33%
Quadratic Programming
33%
Continuous Function
33%
Learning Communications
33%
Empirical Performance
33%
Inapproximability
33%
Time Online
33%
Minimum Norm
33%
System Operation
33%
Revenue Maximization
33%
Subexponential
33%
Computer Science
Approximation (Algorithm)
100%
Polynomial Time
100%
on-line algorithm
100%
Constraint Set
100%
Approximation Ratio
50%
Approximation Algorithms
50%
World Application
50%
Field Research
50%
Quadratic Programming
50%
Continuous Function
50%
System Operation
50%
Machine Learning
50%
Learning System
50%
Engineering
Maximization
100%
Convex Set
100%
Polynomial Time
50%
Matching Algorithm
25%
Real World Application
25%
Communication System
25%
Continuous Function
25%
Summarization
25%
System Operation
25%
Field Study
25%
Learning System
25%