( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.

, и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 802-811. Springer, (2009)

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.

Eishow Katoh

Eishow Katoh

Naoki Yoshida

Marcus Katoh

Eishow Katoh

 

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

A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems., , и . Inf. Process. Lett., 64 (5): 255-261 (1997)Foreword.. Algorithmica, 44 (2): 101-101 (2006)Resource allocation problems - algorithmic approaches., и . MIT Press series in the foundations of computing MIT Press, (1988)Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning., , , и . SODA, стр. 896-904. ACM/SIAM, (2002)Approximation algorithms for combinatorial fractional programming problems., , , и . Math. Program., 37 (3): 255-267 (1987)Minimax Regret 1-Sink Location Problems in Dynamic Path Networks., , , , , и . TAMC, том 7876 из Lecture Notes in Computer Science, стр. 121-132. Springer, (2013)Online Exploration of All Vertices in a Simple Polygon., и . FAW-AAIM, том 7285 из Lecture Notes in Computer Science, стр. 315-326. Springer, (2012)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , и . AAIM, том 4508 из Lecture Notes in Computer Science, стр. 178-190. Springer, (2007)Multiple Sink Location Problems in Dynamic Path Networks., , и . AAIM, том 8546 из Lecture Notes in Computer Science, стр. 149-161. Springer, (2014)A Rooted-Forest Partition with Uniform Vertex Demand., и . WALCOM, том 5942 из Lecture Notes in Computer Science, стр. 179-190. Springer, (2010)