Monaldo Mastrolilli
http://usi.to/hzq
Publications
Journal Article (1)
- Mastrolilli M. (2008) Grouping Techniques for Scheduling Problems: Simpler and Faster, Algorithmica
Conference proceedings (2)
- Mastrolilli M., Svensson O. (2008) (Acyclic) Job Shops Are Hard To Approximate. In proceedings of the 49th Annual Symposium on Foundations of Computer Science (FOCS 2008)
- Ambuehl C., Mastrolilli M., Svensson O. (2007) Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. In proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007)
