论文信息 - On the Budgeted Max-cut Problem and Its Application to the Capacitated Two-parallel Machine Scheduling - 字舞流文

On the Budgeted Max-cut Problem and Its Application to the Capacitated Two-parallel Machine Scheduling

Yinyu Ye | Jiawei Zhang | Y. Ye | Jiawei Zhang

[1] Uri Zwick,et al. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems , 2001, Random Struct. Algorithms.

[2] Yinyu Ye,et al. A .699-Approximation Algorithm for Max-Bisection , 1999 .

[3] Refael Hassin,et al. Approximation algorithms for maximum linear arrangement , 2000, Inf. Process. Lett..

[4] Heng Yang. An Approximation Algorithm for the Two-Parallel Machines Scheduling Problem with Capacity Constraints , 2000 .

[5] Reuven Bar-Yehuda,et al. Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.

[6] Maxim Sviridenko,et al. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.

[7] Martin Skutella,et al. Semidefinite relaxations for parallel machine scheduling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8] Eric Sanlaville,et al. Machine scheduling with availability constraints , 1998, Acta Informatica.

[9] Michael Pinedo,et al. Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[10] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[11] Chung-Yee Lee,et al. Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

[12] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.