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
Approximation schemes for the min-max starting time problem
Leah Epstein
, Tamir Tassa
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%
Polynomial-time Approximation Scheme
100%
Starting Time
100%
Min-max
100%
Time Problem
100%
Fully Polynomial Time Approximation Scheme
33%
Identical Machines
33%
Makespan
33%
Assignment Problem
33%
Order Constraint
33%
Original Order
33%
Linear Hierarchical Model
33%
Offline Scheduling
33%
Computer Science
Time Approximation Scheme
100%
Polynomial Time
100%
approximation scheme
100%
Fully Polynomial-Time Approximation Scheme
33%
Assignment Problem
33%
Scheduling 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%