Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Approximation schemes for the min-max starting time problem
Leah Epstein,
Tamir Tassa
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximation schemes for the min-max starting time problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Scheme
100%
Min-max
100%
Polynomial-time Approximation Scheme
100%
Time Problem
100%
Starting Time
100%
Original Order
33%
Order Constraint
33%
Offline Scheduling
33%
Assignment Problem
33%
Identical Machines
33%
Linear Hierarchical Model
33%
Fully Polynomial Time Approximation Scheme
33%
Makespan
33%
Computer Science
Polynomial Time
100%
Time Approximation Scheme
100%
approximation scheme
100%
Fully Polynomial-Time Approximation Scheme
33%
Scheduling Problem
33%
Assignment Problem
33%
Hierarchical Model
33%
Mathematics
Polynomial Time
100%
Min-Max
100%
Main Result
33%
Hierarchical linear models
33%
Fully Polynomial-Time Approximation Scheme
33%