×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [set cover instance]
NP and Computational Intractability
797 views
Approx
403 views
Approximations for hard problems Example: Scheduling Given: n jobs with processing times, m identical machines. Problem: Schedule so as to minimize makespan
219 views