( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimax Regret 1-Median Problem in Dynamic Path Networks.

, , , , и . CoRR, (2015)

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.

Genn Kameda

 

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

Geometric p-Center Problems with Centers Constrained to Two Lines., , , , , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 24-36. Springer, (2015)Minsum k-Sink Problem on Path Networks., , , , и . CoRR, (2018)A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic., , и . CCCG, стр. 40-47. (2022)A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network., , и . Algorithmica, 70 (1): 2-21 (2014)Where to Build a Door., и . IROS, стр. 4084-4090. IEEE, (2006)Optimizing Squares Covering a Set of Points., , , , и . COCOA, том 8881 из Lecture Notes in Computer Science, стр. 37-52. Springer, (2014)Characterization of Polygons Searchable by a Boundary 1-Searcher., , и . CCCG, (2006)An Optimal Solution to Room Search Problem., , , и . CCCG, (2006)Computing on Anonymous Networks: Part II-Decision and Membership Problems., и . IEEE Trans. Parallel Distributed Syst., 7 (1): 90-96 (1996)Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights., , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 588-597. Springer, (2012)