Author:
Mittal Harshil,Nanoti Saraswati,Sethia Aditi
Publisher
Springer International Publishing
Reference13 articles.
1. Ganesh, A., Vishwa Prakash, H., Nimbhorkar, P., Philip, G.: Disjoint stable matchings in linear time. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 94–105 (2021)
2. Hebrard, E., Hnich, B., O’Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: AAAI, pp. 372–377 (2005)
3. Petit, T., Trapp, A.C.: Finding diverse solutions of high quality to constraint optimization problems. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)
4. Baste, J., Jaffke, L., Masařık, T., Philip, G., Rote, G.: FPT algorithms for diverse collections of hitting sets. Algorithms 12(12), 254 (2019)
5. Danna, E., Woodruff, D.L.: How to select a small set of diverse solutions to mixed integer programming problems. Oper. Res. Lett. 37(4), 255–260 (2009)