( en | de | ru )

 

Disambiguation of "Maehara, Takanori"

Author of the publication

copydeleteadd this publication to your clipboard
Typical Approximation Performance for Maximum Coverage Problem.

, , and . CoRR, (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. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Maehara, Takanori
add a person with the name Maehara, Takanori
 

Other publications of authors with the same name

Revisiting Graph Neural Networks: Graph Filtering Perspective., , and . ICPR, page 8376-8383. IEEE, (2020)Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property., and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 428-441. Springer, (2021)Graph Homomorphism Convolution., and . CoRR, (2020)Computing Personalized PageRank Quickly by Exploiting Graph Structures., , , and . Proc. VLDB Endow., 7 (12): 1023-1034 (2014)Convexity of b-matching Games., and . IJCAI, page 261-267. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Graph Homomorphism Convolution., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 7306-7316. PMLR, (2020)Submodular Stochastic Probing with Prices., and . CoDIT, page 60-66. IEEE, (2019)Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 248-260. Springer, (2019)A framework of discrete DC programming by discrete convex analysis., and . Math. Program., 152 (1-2): 435-466 (2015)Continuous relaxation for discrete DC programming., , and . Math. Program., 169 (1): 199-219 (2018)