Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Activities
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Strongly Polynomial FPTASes for Monotone Dynamic Programs
Tzvi Alon,
Nir Halman
Bar-Ilan University - The Alexander Kofkin Faculty of Engineering
Hebrew University of Jerusalem
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Strongly Polynomial FPTASes for Monotone Dynamic Programs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Fully Polynomial-Time Approximation Scheme
100%
Knapsack
100%
Dynamic Program
100%
Application Problem
66%
Approximation (Algorithm)
33%
Mobile Agents
33%
Automatic Generation
33%
Stochastic Problem
33%
Survival Probability
33%
Keyphrases
Dynamic Programming
100%
Strongly Polynomial
100%
Monotone Dynamics
100%
Fully Polynomial Time Approximation Scheme
42%
0-1 Knapsack Problem
28%
Mobile Agent
14%
Makespan
14%
Bi-criteria
14%
Knapsack
14%
N-tuple
14%
Automatic Generation
14%
Survival Probability
14%
Approximation Function
14%
Approximation Set
14%
Deteriorating Jobs
14%
Path Problems
14%
Mathematics
Polynomial
100%
Fully Polynomial-Time Approximation Scheme
42%
Path Problem
14%
Stochastics
14%
Survival Probability
14%