Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Mastrolilli, Monaldo - Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)
Grouping Techniques for Scheduling Problems: Simpler and Faster
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling #
Vertex Cover in Graphs with Locally Few Colors Fabian Kuhn1
(Acyclic) Job Shops are Hard to Approximate Monaldo Mastrolilli and Ola Svensson
(Acyclic) Job Shops are Hard to Approximate Monaldo Mastrolilli and Ola Svensson
Single machine precedence constrained scheduling is a vertex cover problem
On the Approximability of Single Machine Scheduling with Precedence Constraints
Hardness of Approximating Flow and Job Shop Scheduling Problems
MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No. 4, November 2011, pp. 653669
