( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.

, , , и . IJCAI, стр. 4412-4418. ijcai.org, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

No persons found for author name Kakimura, Naonori
add a person with the name Kakimura, Naonori
 

Другие публикации лиц с тем же именем

Computing Knapsack Solutions with Cardinality Robustness., , и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 693-702. Springer, (2011)An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization., , , и . IJCAI, стр. 4412-4418. ijcai.org, (2017)Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm., , , и . ICML, том 32 из JMLR Workshop and Conference Proceedings, стр. 351-359. JMLR.org, (2014)Delay and Cooperation in Nonstochastic Linear Bandits., , , , , , и . NeurIPS, (2020)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , и . APPROX-RANDOM, том 81 из LIPIcs, стр. 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Matching Problems with Delta-Matroid Constraints., и . CATS, том 128 из CRPIT, стр. 83-92. Australian Computer Society, (2012)Threshold Influence Model for Allocating Advertising Budgets., , , и . ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 1395-1404. JMLR.org, (2015)Dynamic Bipartite Matching Market with Arrivals and Departures., и . WINE, том 13112 из Lecture Notes in Computer Science, стр. 544. Springer, (2021)Online Task Assignment Problems with Reusable Resources., , , , , , и . AAAI, стр. 5199-5207. AAAI Press, (2022)Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays., и . COCOON (2), том 14423 из Lecture Notes in Computer Science, стр. 238-249. Springer, (2023)