Author:
Burch Carl,Carr Robert,Krumke Sven,Marathe Madhav,Phillips Cynthia,Sundberg Eric
Publisher
Kluwer Academic Publishers
Reference17 articles.
1. Bar-Noy, A., Guha, S., Naor, J., and Schieber, B. (2001). Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2):331–352.
2. Boyd, S. and Carr, R. (1999). A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Mathematical Programming, Ser A, 86:499–514.
3. Burch, C, Carr, R. D., Krumke, S. O., Marathe, M., Phillips, C, and Sundberg, E. (2001). Multicriteria approximation through decomposition. (unpublished manuscript).
4. Ford, L. R. and Fulkerson, D. R. (1962). Flows in Networks. Princeton University Press, Princeton, NJ.
5. Ghare, P. M., Montgomery, D. C., and Turner, W. C. (1971). Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly, 18:37–45.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献