{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T15:55:18Z","timestamp":1771689318071,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T00:00:00Z","timestamp":1428451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00453-015-9994-9","type":"journal-article","created":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T15:01:59Z","timestamp":1428418919000},"page":"1184-1203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fair Matchings and Related Problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,8]]},"reference":[{"key":"9994_CR1","unstructured":"Huang, C.-C., Kavitha, T.: Weight-maximal matchings. In: Proceedings of the the 2nd International Workshop on Matching under Preferences, July (2012)"},{"key":"9994_CR2","unstructured":"Mehlhorn, K., Michail, D.: Network Problems with Non-Polynomial Weights and Applications. www.mpi-sb.mpg.de\/mehlhorn\/ftp\/HugeWeights.ps"},{"key":"9994_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"9994_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"JB Orlin","year":"1992","unstructured":"Orlin, J.B., Ahuja, R.K.: New scaling algorithms for the assignment and minimum mean cycle problems. Math. Program. 54(1), 41\u201356 (1992)","journal-title":"Math. Program."},{"key":"9994_CR5","doi-asserted-by":"crossref","unstructured":"Duan, R., Su, H.-H.: A scaling algorithm for maximum weight matchings in bipartite graphs. In: Proccedings of the 23rd SODA, pp. 1413\u20131424 (2012)","DOI":"10.1137\/1.9781611973099.111"},{"issue":"3","key":"9994_CR6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"9994_CR7","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H Gabow","year":"1989","unstructured":"Gabow, H., Tarjan, R.: Faster scaling algorithms for network problems. SIAM J. Comput. 18, 1013\u20131036 (1989)","journal-title":"SIAM J. Comput."},{"key":"9994_CR8","first-page":"27","volume":"3","author":"M Iri","year":"1960","unstructured":"Iri, M.: A new method of solving transportation-network problems. J. Oper. Res. Soc. Jpn. 3, 27\u201387 (1960)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9994_CR9","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"9994_CR10","unstructured":"Sng, C.: Efficient Algorithms for bipartite matching problems with preferences Ph.D. thesis, University of Glasgow, (2008)"},{"key":"9994_CR11","unstructured":"Irving, R.W.: Greedy Matchings. University of Glasgow, Computing Science Department Research Report, TR-2003-136, (2003)"},{"issue":"4","key":"9994_CR12","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9994_CR13","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Shah, C.D.: Efficient algorithms for weighted rank-maximal matchings and related problems. In: Proceedings of the 17th ISAAC, pp. 153\u2013162 (2006)","DOI":"10.1007\/11940128_17"},{"issue":"1\u20132","key":"9994_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.tcs.2007.08.004","volume":"389","author":"D Michail","year":"2007","unstructured":"Michail, D.: Reducing rank-maximal to maximum weight matching. Theor. Comput. Sci. 389(1\u20132), 125\u2013132 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9994_CR15","doi-asserted-by":"crossref","unstructured":"Paluch, K.: Capacitated rank-maximal matchings. In Proceedings of the 8th CIAC, pp. 324\u2013335 (2013)","DOI":"10.1007\/978-3-642-38233-8_27"},{"issue":"3","key":"9994_CR16","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"AV Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24(3), 494\u2013504 (1995)","journal-title":"SIAM J. Comput."},{"key":"9994_CR17","doi-asserted-by":"crossref","unstructured":"Sankowski, P.: Shortest paths in matrix multiplication time. In: Proceedings of the 13th ESA, pp. 770\u2013778 (2005)","DOI":"10.1007\/11561071_68"},{"key":"9994_CR18","doi-asserted-by":"crossref","first-page":"4480","DOI":"10.1016\/j.tcs.2009.07.028","volume":"410","author":"P Sankowski","year":"2009","unstructured":"Sankowski, P.: Maximum weight bipartite matching in matrix multiplication time. Theor. Comput. Sci. 410, 4480\u20134488 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9994_CR19","doi-asserted-by":"crossref","unstructured":"Yuster, R., Zwick, U.: Answering distance queries in directed graphs using fast matrix multiplication. In: Proceedings of the 46th FOCS, pp. 90\u2013100 (2005)","DOI":"10.1109\/SFCS.2005.20"},{"key":"9994_CR20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An $$n^{5\/2}$$ n 5 \/ 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9994_CR21","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1137\/070684008","volume":"39","author":"NJA Harvey","year":"2009","unstructured":"Harvey, N.J.A.: Algebraic structures and algorithms for matching and matroid problems. SIAM J. Comput. 39(2), 679\u2013702 (2009)","journal-title":"SIAM J. Comput."},{"key":"9994_CR22","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: Proceedings of the 45th FOCS, pp. 248\u2013255 (2004)","DOI":"10.1109\/FOCS.2004.40"},{"key":"9994_CR23","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, USA (1993)"},{"key":"9994_CR24","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Tardos, E., Tarjan, R.E.: Network flow algorithms. In: Paths, Flows and VLSI-Design, pp. 101\u2013164. Springer, Berlin (1990)","DOI":"10.21236\/ADA214689"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9994-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9994-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9994-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T22:39:06Z","timestamp":1566513546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9994-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,8]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9994"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9994-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,8]]}}}