Funder
Supported by the Department of Atomic Energy, Government of India
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Bauckholt, F., Pashkovich, K., Sanitá, L.: On the approximability of the stable marriage problem with one-sided ties. arXiv:1805.05391
2. Bhattacharya, S., Hoefer, M., Huang, C.-C., Kavitha, T., Wagner, L.: Maintaining near-popular matchings. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP)(II), pp. 504–515 (2015)
3. Biro, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), pp. 97–108 (2010)
4. Biro, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoret. Comput. Sci. 411, 1828–1841 (2010)
5. Brandl, F., Kavitha, T.: Two problems in max-size popular matchings. Algorithmica 81(7), 2738–2764 (2019)