( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.

, , и . STACS, том 2010 из Lecture Notes in Computer Science, стр. 478-489. Springer, (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 Kawabe

Hiroshi Murata

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

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

Kernel Methods for Chemical Compounds: From Classification to Design., и . IEICE Trans. Inf. Syst., 94-D (10): 1846-1853 (2011)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)An improved approximation algorithm for capacitated multicast routings in networks., и . Theor. Comput. Sci., 390 (1): 81-91 (2008)Bounded-Degree Cut is Fixed-Parameter Tractable., и . CoRR, (2020)Multicommodity flows in certain planar directed networks., и . Discret. Appl. Math., 27 (1-2): 125-145 (1990)Minmax Tree Cover in the Euclidean Space., , и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 202-213. Springer, (2009)Bisecting Two Subsets in 3-Connected Graphs., , , и . ISAAC, том 1741 из Lecture Notes in Computer Science, стр. 425-434. Springer, (1999)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 55-64. Springer, (2009)On the Minimum Local-Vertex-Connectivity Augmentation in Graphs., и . ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 124-135. Springer, (2001)