Hardness of Approximating Flow and Job Shop Scheduling Problems

Title
Hardness of Approximating Flow and Job Shop Scheduling Problems
Authors
Keywords
-
Journal
JOURNAL OF THE ACM
Volume 58, Issue 5, Pages 1-32
Publisher
Association for Computing Machinery (ACM)
Online
2011-10-27
DOI
10.1145/2027216.2027218

Ask authors/readers for more resources

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started