Finding happiness: An analysis of the maximum happy vertices problem
暂无分享,去创建一个
[1] I. Vinod Reddy,et al. The Parameterized Complexity of Happy Colorings , 2017, IWOCA.
[2] Akanksha Agrawal,et al. On the Parameterized Complexity of Happy Vertex Coloring , 2017, IWOCA.
[3] Juho Lauri,et al. Algorithms and hardness results for happy coloring problems , 2017, ArXiv.
[4] Tao Jiang,et al. Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems , 2017, Algorithmica.
[5] Rhyd Lewis,et al. Creating seating plans: a practical application , 2016, J. Oper. Res. Soc..
[6] Anjeneya Swami Kare,et al. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees , 2016, IWOCA.
[7] A. Barabasi,et al. Network science , 2016, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[8] R. M. R. Lewis,et al. Guide to Graph Colouring: Algorithms and Applications , 2015, Texts in Computer Science.
[9] Jonathan M. Thompson,et al. Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem , 2015, Eur. J. Oper. Res..
[10] Ulrik Brandes,et al. What is network science? , 2013, Network Science.
[11] Angsheng Li,et al. Algorithmic aspects of homophyly of networks , 2012, Theor. Comput. Sci..
[12] K. Vehkalahti,et al. Cluster Analysis , 2002, Science.
[13] Gilbert Laporte,et al. Examination Timetabling: Algorithmic Strategies and Applications , 1994 .
[14] Arkady Kanevsky,et al. Finding all minimum-size separating vertex sets in a graph , 1993, Networks.
[15] Manuel López-Ibáñez,et al. Construct , Merge , Solve & Adapt : A New General Algorithm For Combinatorial Optimization , 2015 .
[16] M. Bellows,et al. Finding an optimal seating chart , 2012 .
[17] Ben Paechter,et al. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..