首页 | 本学科首页   官方微博 | 高级检索  
     


Fast primal-dual update against local weight update in linear assignment problem and its application
Affiliation:1. Indeed Japan, 1-4-1 Mita, Minato-ku, 108-0073, Tokyo, Japan;2. Preferred Networks, 1-6-1 Otemachi, Chiyoda-ku, 100-0004, Tokyo, Japan;3. Osaka University, 1-5 Yamadaoka, Suita, 565-0871, Osaka, Japan;4. Tokyo Institute of Technology, 2-12-1, Ookayama, Meguro-ku, 152-8552, Tokyo, Japan;1. Institut für Informatik, TU München, Germany;2. Department of Computer Science, Stanford University, USA;1. Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands;2. Department of Data Analytics and Digitalisation, Maastricht University, Maastricht, the Netherlands;1. Institute of Mathematics for Industry, Kyushu University, Japan;2. Google Research, USA;3. School of Computing, National University of Singapore, Singapore;1. Department of Chemical Engineering, Faculty of Engineering, University of Isfahan, Isfahan, 81746-73441, Iran;2. Department of Polymer Engineering, Faculty of Engineering, Lorestan University, Khorramabad, 68151-44316, Iran
Abstract:
Keywords:Design of algorithms  Assignment problem (bipartite matching)  Envy-free allocation of indivisible items (EF1/EFX)
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号