Hybrid local search approximation algorithm for solving the capacitated Max-K-cut problem
暂无分享,去创建一个
Monty Newborn | Mohammed Almulla | Ludovit Niepel | M. Newborn | M. Almulla | L. Niepel | Safaa Alqallaf | Safaa Alqallaf
[1] Wenxing Zhu,et al. The Complement of Hypergraph Capacitated Min-k-Cut Problem , 2010, 2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming.
[2] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] Salimur Choudhury,et al. An Approximation Algorithm for Max k-Uncut with Capacity Constraints , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.
[4] Srinivas Bollapragada,et al. Scheduling Commercials on Broadcast Television , 2004, Oper. Res..
[5] Zekeriya Uykan,et al. Application of the SpecHybrid Algorithm to text document clustering problem , 2011, 2011 International Symposium on Innovations in Intelligent Systems and Applications.
[6] Mikko Koivisto,et al. An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Hao Tang,et al. Cluster-Based Resource Allocation for Interference Mitigation in LTE Heterogeneous Networks , 2012, 2012 IEEE Vehicular Technology Conference (VTC Fall).
[8] Mordecai Avriel,et al. Stowage planning for container ships to reduce the number of shifts , 1998, Ann. Oper. Res..
[9] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[10] Hoong Chuin Lau,et al. Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , 1997, J. Graph Algorithms Appl..
[11] Ramesh Krishnamurti,et al. An approximation algorithm for max k-uncut with capacity constraints , 2012 .
[12] Rajeev Kohli,et al. The capacitated max k-cut problem , 2005, Math. Program..
[13] Wenxing Zhu,et al. A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph , 2011, 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming.
[14] Rajeev Kohli,et al. Conflict Resolution in the Scheduling of Television Commercials , 2009, Oper. Res..
[15] Hui Tian,et al. Clustering based interference management for QoS guarantees in OFDMA femtocell , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).
[16] Wenxing Zhu,et al. On a local search algorithm for the capacitated max-k-cut problem , 2014 .
[17] Dan Hu,et al. Clustering strategy based on graph method and power control for frequency resource management in femtocell and macrocell overlaid system , 2011, Journal of Communications and Networks.