Conflict Resolution in the Scheduling of Television Commercials
暂无分享,去创建一个
[1] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[2] Rajeev Kohli,et al. The capacitated max k-cut problem , 2005, Math. Program..
[3] Refael Hassin,et al. A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts , 2001, SIAM J. Discret. Math..
[4] J. Baewicz,et al. A linear time algorithm for restricted bin packing and scheduling problems , 1983 .
[5] Maxim Sviridenko,et al. An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts , 1999 .
[6] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[7] Sanjeev Mahajan,et al. Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..
[8] J. P. Warners,et al. On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function , 2004 .
[9] Srinivas Bollapragada,et al. Scheduling Commercials on Broadcast Television , 2004, Oper. Res..
[10] Jay E. Aronson,et al. Spot: Scheduling Programs Optimally for Television , 1998 .
[11] Abraham P. Punnen,et al. Approximate local search in combinatorial optimization , 2004, SODA '04.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[14] Gunnar Andersson,et al. An Approximation Algorithm for Max p-Section , 1999, STACS.
[15] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[16] David P. Williamson,et al. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming , 2001, STOC '01.
[17] Michael Langberg,et al. Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.