Author:
Correa José R.,Skutella Martin,Verschae José
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference37 articles.
1. Afrati F., Bampis E., Chekuri C., Karger D., Kenyon C., Khanna S., Milis I., Queyranne M., Skutella M., Stein C., Sviridenko M. Approximation schemes for minimizing average weighted completion time with release datesProc. 40th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS)(1999) Washington, DCIEEE Computer Society3243
2. Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
3. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
4. Bansal N., Khot S. Optimal long code test with one free bitProc. 50th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS)(2009) Washington, DCIEEE Computer Society453462
5. Bansal N., Khot S. Inapproximability of hypergraph vertex cover and applications to scheduling problemsProc. 37th Internat. Colloquium on Automata, Languages and Programming (ICALP)(2010) 6198BerlinSpringer-Verlag250261Lecture Notes in Computer Science
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献