WebHanna Sumita Tokyo Metropolitan University [email protected] Kei Takemura NEC Corporation [email protected] Takuro Fukunagaz Chuo University, RIKEN AIP, JST PRESTO [email protected] Naonori Kakimurax Keio University [email protected] Ken-ichi Kawarabayashix National Institute of Informatics k … WebFeb 9, 2024 · Hanna Sumita, Yuuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi, An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization, IJCAI 2024 - The 26th International Joint Conference on Artificial Intelligence, pp.4412-4418, 2024. Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, …
Randomized Strategies for Robust Combinatorial Optimization
WebFeb 26, 2024 · Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. Koichi Nishimura, Hanna Sumita. We study fair allocation of resources consisting of both divisible and indivisible goods to agents with additive valuations. Recently, a fairness notion called envy-freeness for mixed goods (EFM) has been introduced for this setting. WebRead Hanna Sumita's latest research, browse their coauthor's research, and play around with their algorithms grill master products
dblp: Hanna Sumita
WebHanna Sumita's 29 research works with 50 citations and 669 reads, including: Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks WebThe following articles are merged in Scholar. Their combined citations are counted only for the first article. 澄田範奈 (Hanna SUMITA) ... H. Sumita, Y. Yonebayashi, N. Kakimura and K. Kawarabayashi: An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2024), pp. … See more fifth-percentile