( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimum cost source location problem with vertex-connectivity requirements in digraphs.

, , и . Inf. Process. Lett., 80 (6): 287-293 (2001)

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.

Hiroshi Murata

Hiroshi Kawabe

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

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

A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts., и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 377-390. Springer, (1999)A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs., , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 228-240. Springer, (2015)A Detachment Algorithm for Inferring a Graph from Path Frequency.. COCOON, том 4112 из Lecture Notes in Computer Science, стр. 274-283. Springer, (2006)Approximating a Generalization of Metric TSP., и . IEICE Trans. Inf. Syst., 90-D (2): 432-439 (2007)On the approximation of the generalized capacitated tree-routing problem., и . J. Discrete Algorithms, 8 (3): 311-320 (2010)Unranking of small combinations from large sets., , и . J. Discrete Algorithms, (2014)Kernel Methods for Chemical Compounds: From Classification to Design., и . IEICE Trans. Inf. Syst., 94-D (10): 1846-1853 (2011)An improved approximation algorithm for capacitated multicast routings in networks., и . Theor. Comput. Sci., 390 (1): 81-91 (2008)A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming., , , , , и . ICBBB, стр. 40-46. ACM, (2020)A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs., , и . COCOON, том 1627 из Lecture Notes in Computer Science, стр. 164-173. Springer, (1999)